Heawood graph $\cong$ Incidence Graph of $PG(2,2)$
$\cong$ Incidence graph of Hadamard $(7,3,1)$-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:$Aut(PSL(3,2)) \cong PSL(3,2):2 \cong PGL(2,7)$
Distance-transitive:Yes
Bipartite


Heawood graph

Downloads

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: 31 March 2019