Distance-regular graphs with an eigenvalue -k < 2-k

zbMATH Open1300.05157MaRDI QIDQ405062FDOQ405062

Authors: Sejeong Bang 

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A valency bound for distance-regular graphs
• Non-bipartite distance-regular graphs with a small smallest eigenvalue
• Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)
• Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
• Distance-regular graphs with a relatively small eigenvalue multiplicity

zbMATH Keywords

distance-regular graphgirthsmallest eigenvaluefolded \((2D + 1)\)-cube

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Algebraic Graph Theory
• 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
• The distance-regular graphs such that all of its second largest local eigenvalues are at most one

Cited In (16)

• The distance-regular graphs such that all of its second largest local eigenvalues are at most one
• Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
• Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
• The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)
• Eigenvalues of thick regular near hexagons
• Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)
• Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\)
• A note on distance-regular graphs with a small number of vertices compared to the valency
• The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one
• Non-bipartite distance-regular graphs with a small smallest eigenvalue
• Distance-regular graphs with a relatively small eigenvalue multiplicity
• Title not available (Why is that?)
• Bounding the diameter of distance. Regular graphs
• A valency bound for distance-regular graphs
• Some results on the eigenvalues of distance-regular graphs
• Distance-regular graphs with small number of distinct distance eigenvalues

This page was built for publication: Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405062)