Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
From MaRDI portal
Publication:405062
zbMath1300.05157MaRDI QIDQ405062
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p4
Related Items (2)
Some results on the eigenvalues of distance-regular graphs ⋮ Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
Cites Work
- Unnamed Item
- The distance-regular graphs such that all of its second largest local eigenvalues are at most one
- Distance-regular graphs with girth 3 or 4: I
- The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)
- The distance-regular graphs of valency four
- Algebraic Graph Theory
This page was built for publication: Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)