Petersen graph
Petersen graph noun: an undirected graph with 10 vertices and 15 edges, serving as a simple example and counterexample for many problems in graph theory.

Noun
Petersen graph (plural Petersen graphs)
- An undirected graph with 10 vertices and 15 edges, serving as a simple example and counterexample for many problems in graph theory.
Forms of Petersen graph
| plural | Petersen graphs |
|---|
Origin of Petersen graph
Named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring.
Questions about Petersen graph
- What does Petersen graph mean?
- Petersen graph means an undirected graph with 10 vertices and 15 edges, serving as a simple example and counterexample for many problems in graph theory.
- What part of speech is Petersen graph?
- Petersen graph is a noun.
- What is the plural of Petersen graph?
- The plural of Petersen graph is Petersen graphs.
Words near Petersen graph in the dictionary
Source and license
Adapted from Wiktionary: Petersen graph (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Petersen graph.” Word.ws, https://word.ws/petersen_graph. Based on Wiktionary, CC BY-SA 4.0.
