DistanceRegular.org
$K_{5,5}-I$
Number of vertices:
$10$
Diameter:
$3$
Intersection array:
$\{4,3,1; 1,3,4\}$
Spectrum:
$4^1 1^4 (-1)^4 (-4)^1$
Automorphism group:
$S_5 \times \mathbb{Z}_2$
Distance-transitive:
Yes
Bipartite
,
Antipodal
Downloads
Adjacency matrix
Adjacency matrix in GAP format
Adjacency matrix in CSV format
Graph in GRAPE format
Links
Wikipedia: Crown Graph $K_{n,n}-I$
Wolfram: Crown Graph $K_{n,n}-I$
Back to:
A-Z index
•
Graphs with up to 50 vertices
•
Graphs with diameter 3
•
Graphs with valency 4
•
Crown Graphs
Last updated: 4 February 2017