$\text{Heawood graph }\cong \text{ Incidence Graph of }PG(2,2)$
$\cong\text{ Incidence graph of Hadamard }(7,3,1)\text{-design}$

Number of vertices:$14$
Diameter:$3$
Intersection array:$\{3,2,2; 1,1,3\}$
Spectrum:$3^1 (\sqrt{2})^6 (-\sqrt{2})^6 (-3)^1$
Automorphism group:$PGL(2,7)$
Distance-transitive:$\text{Yes}$
Bipartite


Heawood graph

$\text{Downloads}$

$\text{Links}$

Back to: A-Z indexGraphs with up to 50 verticesGraphs with diameter 3Graphs with valency 3Incidence Graphs
See also: Distance-3 graph of Heawood graph
Last updated: 19 February 2017