Petersen graph Guide, Meaning , Facts, Information and Description
The Petersen graph is a small graph that serves as a useful example and counterexample in graph theory.
The Petersen graph is the smallest cubic graph that has no Hamiltonian cycle, the smallest cubic graph of girth 5, and the largest cubic graph with diameter 2. It is nonplanar. Although it appears to contain a subgraph homomorphic to K5, it doesn't; however, it does contain a subgraph homomorphic to K3,3.
It is named for the Danish mathematician Julius Petersen.
The Petersen graph family is a finite family of graphs that can be formed from the complete graph on 6 vertices, K6, by zero or more applications of delta-Y or Y-delta transforms. The eight graphs in this family include K6 and the Petersen graph.
This family can be used to test a graph for linkless emebeddability, in the same way that K5 and K3,3 are used to test for planarity. This is an Article on Petersen graph. Page Contains Information, Facts Details or Explanation Guide About Petersen graph Petersen graph family