Back Heawoodův graf Czech Heawood-Graph German Grafo de Heawood Spanish Heawoodi graaf Estonian گراف هیوود Persian Graphe de Heawood French Grafo di Heawood Italian ヒーウッドグラフ Japanese Grafo de Heawood Portuguese Граф Хивуда Russian
| Heawood graph | |
|---|---|
 | |
| Named after | Percy John Heawood |
| Vertices | 14 |
| Edges | 21 |
| Radius | 3 |
| Diameter | 3 |
| Girth | 6 |
| Automorphisms | 336 (PGL2(7)) |
| Chromatic number | 2 |
| Chromatic index | 3 |
| Genus | 1 |
| Book thickness | 3 |
| Queue number | 2 |
| Properties | Bipartite Cubic Cage Distance-transitive Distance-regular Toroidal Hamiltonian Symmetric Orientably simple |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood.[1]
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search