Thin \(Q\)-polynomial distance-regular graphs have bounded \(c_2\)
From MaRDI portal
Publication:2093103
DOI10.1007/s00373-022-02573-0OpenAlexW4306294684MaRDI QIDQ2093103
Meng-Yue Cao, Jack H. Koolen, Ying-Ying Tan, Jongyook Park
Publication date: 4 November 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02573-0
distance-regular graphsclassical parameters\(Q\)-polynomial distance-regular graphsthin distance-regular graphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Distance-regular graphs
- Characterizing \((\ell ,m)\)-walk-regular graphs
- Distance-regular graphs with or at least half the valency
- The subconstituent algebra of an association scheme. I
- The subconstituent algebra of an association scheme. III
- Parameters of association schemes that are both P- and Q-polynomial
- The spectra of the local graphs of the twisted Grassmann graphs
- On a characterization of bilinear forms graphs
- Classical distance-regular graphs of negative type
- Remarks on pseudo-vertex-transitive graphs with small diameter
- On almost distance-regular graphs
- Geometric aspects of 2-walk-regular graphs
- A new family of distance-regular graphs with unbounded diameter
- Spectral and Geometric Properties of k-Walk-Regular Graphs
- Sesqui-regular graphs with fixed smallest eigenvalue