Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js
DistanceRegular.org
Doubled Odd graph
D
(
O
5
)
Number of vertices:
252
Diameter:
9
Intersection array:
{
5
,
4
,
4
,
3
,
3
,
2
,
2
,
1
,
1
;
1
,
1
,
2
,
2
,
3
,
3
,
4
,
4
,
5
}
Spectrum:
5
1
4
8
3
27
2
48
1
42
(
−
1
)
42
(
−
2
)
48
(
−
3
)
27
(
−
4
)
8
(
−
5
)
1
Automorphism group:
S
9
×
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: Bipartite Double Cover
Wolfram: Bipartite Double Graph
Andries Brouwer: Odd graph
Wikipedia: Odd graph
Wolfram: Odd graph
Back to:
A-Z index
•
Graphs with 201-300 vertices
•
Graphs with diameter 9
•
Graphs with valency 5
•
Bipartite doubles
Last updated: 28 February 2024