DistanceRegular.org
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
Downloads
Adjacency matrix
Adjacency matrix in GAP format
Adjacency matrix in CSV format
Graph in GRAPE format
Links
Andries Brouwer
Wikipedia
Wolfram
Back to:
A-Z index
•
Graphs with up to 50 vertices
•
Graphs with diameter 3
•
Graphs with valency 3
•
Incidence Graphs
See also:
Distance-3 graph of Heawood graph
Last updated: 31 March 2019