Processing math: 100%
DistanceRegular.org
Incidence graph of
A
G
(
2
,
13
)
minus a parallel class
Number of vertices:
338
Diameter:
4
Intersection array:
{
13
,
12
,
12
,
1
;
1
,
1
,
12
,
13
}
Spectrum:
13
1
(
√
13
)
156
0
24
(
−
√
13
)
156
(
−
13
)
1
Distance-transitive:
Yes
Bipartite
,
Antipodal
Downloads
Adjacency matrix
Adjacency matrix in GAP format
Adjacency matrix in CSV format
Graph in GRAPE format
Back to:
A-Z index
•
Graphs with 301-500 vertices
•
Graphs with diameter 4
•
Graphs with valency 13
•
Incidence Graphs
Last updated: 13 June 2024