Graph Theory

References

Cite

Share

Abstract

Graphs may be classified in many ways apart from their order. A complete graph has each distinct pair of vertices connected by an edge. Many interesting problems arise in looking at complete graphs, several of which have to do with determining whether or not it is possible to pass through every vertex and edge once and only once (a Peterson cycle). A connected graph allows movement from any vertex to another moving along edges of the graph.