DistanceRegular.org
Hadamard graph on 48 vertices $\cong$ Incidence graph of $\mathrm{STD}_6[12;2]$
Number of vertices:
$48$
Diameter:
$4$
Intersection array:
$\{12,11,6,1;1,6,11,12\}$
Spectrum:
$12^1 (\sqrt{12})^{12} 0^{22} (-\sqrt{12})^{12} (-12)^1$
Automorphism group:
$(2.M_{12}):2$
Distance-transitive:
Yes
Bipartite, Antipodal
Downloads
Adjacency matrix
Adjacency matrix in GAP format
Adjacency matrix in CSV format
Graph in GRAPE format
Links
Wolfram: Hadamard graph
Back to:
A-Z index
•
Graphs with up to 50 vertices
•
Graphs with diameter 4
•
Graphs with valency 12
Last updated: 31 March 2019