Determination of the distance-regular graphs without 3-claws

DOI10.1016/S0012-365X(96)00022-2zbMath0871.05062OpenAlexW2084743444MaRDI QIDQ1356547

Andries E. Brouwer, Aart Blokhuis

Publication date: 9 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00022-2

zbMATH Keywords

strongly regular graphdistance-regular graphsSchläfli graphtriangular graphlattice graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items

On bounding the diameter of a distance-regular graph, Geometric distance-regular graphs without 4-claws, On distance-regular graphs without 4-claws, On the geometricity of distance-regular graphs without 4-claws, Distance-regular graphs with or at least half the valency, The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\), Distance-regular graphs without 4-claws

Cites Work

• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Unnamed Item