DistanceRegular.org
$\text{Incidence graph of } PG(3,2)$
Number of vertices:
$30$
Diameter:
$3$
Intersection array:
$\{7,6,4;1,3,7\}$
Spectrum:
$7^1 2^{14} (-2)^{14} (-7)^1$
Automorphism group:
$Aut(PGL(4,2)) \cong PGL(4,2).2 \cong S_{8}$
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 7
•
Incidence Graphs
Last updated: 31 March 2019