The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one
From MaRDI portal
Publication:2065922
DOI10.1016/j.disc.2021.112749zbMath1480.05049OpenAlexW4200129390MaRDI QIDQ2065922
Xiaoye Liang, Jack H. Koolen, Yuanjiang Zhang
Publication date: 13 January 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112749
intersection numberlocal eigenvalue\(t\)-walk-regular graph\( \mu \)-graph\(t\)-partially distance-regular graph
Related Items
2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- The distance-regular graphs such that all of its second largest local eigenvalues are at most one
- Characterizing \((\ell ,m)\)-walk-regular graphs
- A local characterization of the Johnson scheme
- The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)
- On almost distance-regular graphs
- Geometric aspects of 2-walk-regular graphs
- Graph Theory
- Exceptional graphs with smallest eigenvalue -2 and related problems