Bounding the intersection number \(c_2\) of a distance-regular graph with classical parameters \((D, b, \alpha, \beta)\) in terms of \(b\)
From MaRDI portal
Publication:6646381
DOI10.1016/J.DISC.2024.114239MaRDI QIDQ6646381
Chenhui Lv, Qianqian Yang, Jack H. Koolen, Jongyook Park
Publication date: 2 December 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Distance-regular graphs
- The subconstituent algebra of an association scheme. I
- Classical distance-regular graphs of negative type
- Thin \(Q\)-polynomial distance-regular graphs have bounded \(c_2\)
- Sesqui-regular graphs with fixed smallest eigenvalue
- Further study of distance-regular graphs with classical parameters with \(b < -1\)
- Some remarks on the parameter \(c_2\) for a distance-regular graph with classical parameters
This page was built for publication: Bounding the intersection number \(c_2\) of a distance-regular graph with classical parameters \((D, b, \alpha, \beta)\) in terms of \(b\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646381)
