Johnson graph J(17,3) | DistanceRegular.org

Processing math: 100%

Johnson graph $J(17,3)$

Number of vertices:	$680$
Diameter:	$3$
Intersection array:	$\{42,26,12;1,4,9\}$
Spectrum:	$42^1 25^{16} 10^{119} (-3)^{544}$
Automorphism group:	$S_{17}$
Distance-transitive:	Yes
Primitive

Downloads

Links

Back to: A-Z index • Graphs with 501-1000 vertices • Graphs with diameter 3 • Johnson Graphs

Last updated: 22 April 2024