DistanceRegular.org
Incidence graph of Higman's symmetric design
Number of vertices:
$352$
Diameter:
$3$
Intersection array:
$\{50,49,36;1,14,50\}$
Spectrum:
$50^1 6^{174} (-6)^{174} (-50)^1$
Automorphism group:
$HS.2$
Distance-transitive:
Yes
Bipartite
Downloads
Adjacency matrix
Adjacency matrix in GAP format
Adjacency matrix in CSV format
Graph in GRAPE format
Back to:
A-Z index
•
Graphs with more than 200 vertices
•
Graphs with diameter 3
•
Incidence Graphs
•
Graphs from Golay codes and Witt designs
Last updated: 1 February 2017