DistanceRegular.org
$\text{Distance-3 graph of Heawood graph }$
$\cong \text{Incidence graph of biplane on 7 points}$
Number of vertices:
$14$
Diameter:
$3$
Intersection array:
$\{4,3,2; 1,2,4\}$
Spectrum:
$4^1 (\sqrt{2})^6 (-\sqrt{2})^6 (-4)^1$
Automorphism group:
$PGL(2,7)$
Distance-transitive:
$\text{Yes}$
Bipartite
$\text{Downloads}$
$\text{Adjacency matrix}$
$\text{Adjacency matrix in GAP format}$
$\text{Adjacency matrix in CSV format}$
$\text{Graph in GRAPE format}$
Back to:
A-Z index
•
Graphs with up to 50 vertices
•
Graphs with diameter 3
•
Graphs with valency 4
•
Incidence Graphs
See also:
Heawood graph
Last updated: 19 February 2017