On 2-walk-regular graphs with a large intersection number c₂
From MaRDI portal
Publication:2311368
DOI10.1016/J.EJC.2018.02.028zbMATH Open1416.05161OpenAlexW2793181666MaRDI QIDQ2311368FDOQ2311368
Authors: Zhi Qiao, Jongyook Park, Jack H. Koolen 
Publication date: 10 July 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2018.02.028
Recommendations
- 2-walk-regular graphs with a small number of vertices compared to the valency
- A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph
- Amply regular graphs and block designs
- Geometric aspects of 2-walk-regular graphs
- A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter \(d=3i -1\) with \(b_ i =1\) and \(k>2\)
Cites Work
- Title not available (Why is that?)
- Spectra of graphs
- Title not available (Why is that?)
- On almost distance-regular graphs
- Distance-regular graphs
- Characterizing \((\ell ,m)\)-walk-regular graphs
- A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph
- On \(k\)-walk-regular graphs
- A valency bound for distance-regular graphs
- 2-walk-regular dihedrants from group-divisible designs
- 2-walk-regular graphs with a small number of vertices compared to the valency
- Some results on the eigenvalues of distance-regular graphs
- Distance-regular graphs and (s,c,a,k)-graphs
- Classification of small \((0,2)\)-graphs
- Classification of the (0, 2)-graphs of valency 8
Cited In (2)
This page was built for publication: On 2-walk-regular graphs with a large intersection number \(c_2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311368)
