| ENCYCLOPEDIA 4U .com |
Encyclopedia Home Page |
|
|
Petersen graphThe 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. 
|
Content on this web site is provided for informational purposes only. We accept no responsibility for any loss, injury or inconvenience sustained by any person resulting from information published on this site. We encourage you to verify any critical information with the relevant authorities.
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Petersen graph".