An improvement of the Boshier-Nomura bound

DOI10.1006/jctb.1994.1025zbMath0806.05067OpenAlexW2048940599MaRDI QIDQ1328378

Akira Hiraki

Publication date: 14 February 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1025

zbMATH Keywords

distance-regular graphsdiametercircuitintersection arrayBoshier-Nomura boundcircuit-chassing technique

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (8)

On strongly closed subgraphs of highly regular graphs ⋮ A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph ⋮ Almost 2-homogeneous graphs and completely regular quadrangles ⋮ The distance-regular graphs of valency four ⋮ Retracing argument for distance-regular graphs ⋮ On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7 ⋮ An application of intersection diagrams of high rank ⋮ A distance-regular graph with strongly closed subgraphs

This page was built for publication: An improvement of the Boshier-Nomura bound