Incidence graphs of Hadamard $(15,7,3)$-designs (4 graphs)

The incidence graph of $PG(3,2)$ is the first graph in each file.

Number of vertices:$30$
Diameter:$3$
Intersection array:$\{7,6,4;1,3,7\}$
Spectrum:$7^1 2^{14} (-2)^{14} (-7)^1$
Distance-transitive:$PG(3,2)$ only
Bipartite




Downloads

Links

Back to: A-Z index • Graphs with up to 50 vertices • Graphs with diameter 3 • Graphs with valency 7 • Incidence Graphs
Last updated: 1 February 2017