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

From OpenWetWare

Jump to: navigation, search

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

V = {v1,v2,v3,v4}

and

E = {(v1,v2),(v1,v3),(v2,v3),(v3,v4)}.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current05:54, 27 September 2006234×171 (2 KB)NaokiMatsumaru (Talk | contribs) (An example of an undirected graph with four nodes and four edges. )

Personal tools