There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency

DOI10.1515/CRELLE.2009.080zbMath1247.05273OpenAlexW2014708145MaRDI QIDQ3645154

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

Publication date: 16 November 2009

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/crelle.2009.080

zbMATH Keywords

distance-regular graphBannai-Ito conjecture

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (1)

There are only finitely many distance-regular graphs of fixed valency greater than two

Cites Work

• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. II
• On distance-regular graphs with fixed valency. III
• A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph
• 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
• The nonexistence of certain generalized polygons
• Two theorems concerning the Bannai-Ito conjecture

This page was built for publication: There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency