A note on distance-regular graphs with a small number of vertices compared to the valency
From MaRDI portal
Publication:2444727
DOI10.1016/j.ejc.2013.01.006zbMath1285.05045OpenAlexW2020092034MaRDI QIDQ2444727
Publication date: 11 April 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2013.01.006
Related Items (6)
Potential theory on finite networks ⋮ Boundary Value Problems on Finite Networks ⋮ Distance-regular graphs of diameter 3 having eigenvalue \(-1\) ⋮ The \(M\)-matrix group inverse problem for distance-biregular graphs ⋮ 2-walk-regular graphs with a small number of vertices compared to the valency ⋮ The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
Cites Work
- A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- The vertex-connectivity of a distance-regular graph
- Bounding the diameter of distance. Regular graphs
- An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
- Distance–regular graphs having theM-property
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A note on distance-regular graphs with a small number of vertices compared to the valency
