ON DISTANCE-REGULAR GRAPHS WITH c4=1 AND a1≠a2

DOI10.2206/kyushujm.52.265zbMath0978.05076OpenAlexW2006812171MaRDI QIDQ4221153

Yuelan Chen, Akira Hiraki, Jack H. Koolen

Publication date: 27 January 2002

Published in: Kyushu Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2206/kyushujm.52.265

zbMATH Keywords

eigenvaluedistance-regular graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Related Items (2)

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

This page was built for publication: ON DISTANCE-REGULAR GRAPHS WITH c4=1 AND a1≠a2