File:Graph-structure-mis-n04-01.png

An example of an undirected graph with four vertexes and four edges. For this example, the graph [math]\displaystyle{ G=\langle V,E\rangle }[/math] can be defined as a tuple of a set of vertexes [math]\displaystyle{ V }[/math] and a set of edges [math]\displaystyle{ E }[/math] where:

[math]\displaystyle{ V=\{v_1, v_2, v_3,v_4\} }[/math]

and

[math]\displaystyle{ E=\{(v_1,v_2), (v_1, v_3), (v_2,v_3), (v_3, v_4)\} }[/math].