DistanceRegular.org
Line graph of Heawood graph
Number of vertices:
$21$
Diameter:
$3$
Intersection array:
$\{4,2,2; 1,1,2\}$
Spectrum:
$4^1 (1+\sqrt{2})^6 (1-\sqrt{2})^6 (-2)^8$
Automorphism group:
$PGL(2,7)$
Distance-transitive:
Yes
Primitive
Downloads
Adjacency matrix
Adjacency matrix in GAP format
Adjacency matrix in CSV format
Graph in GRAPE format
Links
Wikipedia: Line graph
Wolfram: Line graph
Andries Brouwer: Heawood graph
Wikipedia: Heawood graph
Wolfram: Heawood graph
Back to:
A-Z index
•
Graphs with up to 50 vertices
•
Graphs with diameter 3
•
Graphs with valency 4
•
Line Graphs
Last updated: 4 February 2017