DistanceRegular.org
Van Lint–Schrijver graph on 256 vertices
Number of vertices:
$256$
Diameter:
$2$
Intersection array:
$\{85,60;1,30\}$
Spectrum:
$85^1 5^{170} (-11)^{85}$
Automorphism group:
$2^8:(85:8)$
Distance-transitive:
Yes
Primitive
Downloads
Adjacency matrix
Adjacency matrix in GAP format
Adjacency matrix in CSV format
Graph in GRAPE format
Back to:
A-Z index
•
Graphs with 201-300 vertices
•
Graphs with diameter 2
•
Van Lint–Schrijver graphs
Last updated: 16 July 2024