On 2-walk-regular graphs with a large intersection number c₂
From MaRDI portal
Publication:2311368
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
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- 2-walk-regular dihedrants from group-divisible designs
- 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
- A valency bound for distance-regular graphs
- Characterizing \((\ell ,m)\)-walk-regular graphs
- Classification of small \((0,2)\)-graphs
- Classification of the (0, 2)-graphs of valency 8
- Distance-regular graphs
- Distance-regular graphs and (s,c,a,k)-graphs
- On \(k\)-walk-regular graphs
- On almost distance-regular graphs
- Some results on the eigenvalues of distance-regular graphs
- Spectra of graphs
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)
