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

DOI10.1515/CRELLE.2009.080MaRDI QIDQ3645154zbMATH OpenOpenAlexFDO

Authors Sejeong Bang, Jack H. Koolen, Vincent 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)

Recommendations

• There are only finitely many distance-regular graphs of fixed valency greater than two
• On distance-regular graphs with fixed valency
• On some distance-regular graphs with many vertices
• Distance-regular graphs and \((\alpha,\beta)\)-geometries
• On distance-regular graphs with fixed valency. II
• On distance-regular graphs with fixed valency. IV
• A valency bound for distance-regular graphs
• Geodetically closed subgraphs in a distance-regular graph
• On distance-regular graphs with fixed valency. III
• Distance-regular graphs with or at least half the valency

Cites work

• A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph
• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. II
• On distance-regular graphs with fixed valency. III
• The nonexistence of certain generalized polygons
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
• Two theorems concerning the Bannai-Ito conjecture

Cited in

(4)

• Two theorems concerning the Bannai-Ito conjecture
• There are only finitely many distance-regular graphs of fixed valency greater than two
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3645154)