Definition of a Simple Graph
A simple graph G consists of a non-empty finite set V(G) of elements called vertices, and a finite set E(G) of distinct unordered pairs of distinct elements of V(G) called edges.
-Introduction to Graph Theory by Robin J. Wilson
Example of simple square:
V(G) = {v1, v2, v3, v4}
E(G) = {{v1, v2}, {v2, v3}, {v3, v4}, {v1, v4}}















