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

MaRDI QIDQ405062zbMATH OpenFDO

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

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

zbMATH Keywords

distance-regular graphfolded \((2D + 1)\)-cubegirthsmallest eigenvalue

Mathematics Subject Classification ID

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

Review text

Summary: It is known that bipartite distance-regular graphs with diameter \(D\geq 3\), valency \(k\geq 3\), intersection number \(c_2\geq 2\) and eigenvalues \(k = \theta_0 > \theta_1 > \cdots > \theta_D\) satisfy \(\theta_1\leq k-2\) and thus \(\theta_{D-1}\geq 2-k\). In this paper we classify non-complete distance-regular graphs with valency \(k\geq 2\), intersection number \(c_2\geq 2\) and an eigenvalue \(\theta\) satisfying \(-k< \theta \leq 2-k\). Moreover, we give a lower bound for valency \(k\) which implies \(\theta_D \geq 2-k\) for distance-regular graphs with girth \(g\geq 5\) satisfying \(g=5\) or \( g \equiv 3~(\operatorname{mod}~4)\).

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

Cites work

• Algebraic Graph Theory
• Distance-regular graphs with girth 3 or 4: I
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• The distance-regular graphs of valency four
• The distance-regular graphs such that all of its second largest local eigenvalues are at most one
• The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)

Cited in

(17)

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

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)