Petersen graph

From Graph
Revision as of 18:11, 28 May 2012 by Vipul (talk | contribs)

This article defines a particular undirected graph, i.e., the definition here determines the graph uniquely up to graph isomorphism.
View a complete list of particular undirected graphs

Definition

The Petersen graph is a particular undirected graph on 10 vertices that can be defined in the following equivalent ways:

  1. It is the complement of the line graph of complete graph:K5.
  2. It is the Kneser graph : its vertices are identified with subsets of size two of a 5-element set, and two vertices are adjacent if and only if the corresponding subsets are disjoint.
  3. It is the unique 5-cage.