A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph

DOI10.1016/S0195-6698(03)00092-1zbMath1026.05105OpenAlexW2151161654MaRDI QIDQ1413223

Sejeong Bang, Jack H. Koolen, Vincent L. Moulton

Publication date: 16 November 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(03)00092-1

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (3)

On bounding the diameter of a distance-regular graph ⋮ There are only finitely many distance-regular graphs of fixed valency greater than two ⋮ There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency

Cites Work

• Unnamed Item
• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. III
• On distance-regular graphs with fixed valency. IV
• An improvement of the Ivanov bound
• A distance-regular graph with strongly closed subgraphs
• Distance-regular subgraphs in a distance-regular graph. III
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
• An improvement of the Godsil bound
• A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph
• Cubic Distance-Regular Graphs
• ON DISTANCE-REGULAR GRAPHS WITH c4=1 AND a1≠a2

This page was built for publication: A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph