Definition:Simple Graph

A simple graph is a graph which is;


 * Not a multigraph, i.e. there is no more than one edge between each pair of vertices;


 * Not a loop-graph, i.e. there are no loops, that is, edges which start and end at the same vertex;


 * An undirected graph, i.e. the edges are defined as doubleton sets of vertices and not ordered pairs;


 * Not a weighted graph, i.e. the edges are not mapped to a number.