Combinatorics Graph theory: basic notions Example
Petersen graph
Example
The Petersen graph is the graph whose vertices are the -element subsets of . Two vertices are adjacent if and only if they are disjoint subsets.
It has vertices and edges, and it is -regular.
Remarks
Its shortest cycle has length . It is not Hamiltonian, and it is not planar. Its chromatic number is , and its edges cannot be coloured with colours. A common drawing shows it as a pentagon outside, a pentagram inside, and five spokes.
Further reading
- Web https://en.wikipedia.org/wiki/Petersen_graph, Constructions
About this page
| Tag | 0NR95CTFCZ |
|---|---|
| URI | m2://0NR95CTFCZ |
| Kind | example |
| Writing | W2 usable |
| MSC | 05C99 |
| Instance of | Graph |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W3
- a person confirmed each agent-written section: rule P04 (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.