Petersen graph en · NOUN
Etymology
Named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring.
Meanings
- An undirected graph with 10 vertices and 15 edges, serving as a simple example and counterexample for many problems in graph theory.
Forms
| Spelling | Features | Labels | Source |
|---|---|---|---|
| Petersen graphs | Number=Plur | lexicographic |