$\text{Hadamard graph on 32 vertices}\cong\text{Incidence graph of }\mathrm{STD}_4[8;2]$

Number of vertices:$32$
Diameter:$4$
Intersection array:$\{8,7,4,1; 1,4,7,8\}$
Spectrum:$8^1 (\sqrt{8})^8 0^{14} (-\sqrt{8})^8 (-8)^1$
Distance-transitive:$\text{Yes}$
Bipartite, Antipodal




$\text{Downloads}$

Links

Back to: A-Z indexGraphs with up to 50 verticesGraphs with diameter 4Graphs with valency 8
Last updated: 7 June 2017