An inequality involving the second largest and smallest eigenvalue of a distance-regular graph

DOI10.1016/J.LAA.2010.12.032MaRDI QIDQ2431156zbMATH OpenOpenAlexWikidataFDO

Authors Jack H. Koolen, Jongyook Park, Hyonju Yu

Publication date 11 April 2011

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1004.1056

zbMATH Keywords

bounds on eigenvaluesdistance-regular graphShill distance-regular graphstight distance-regular graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Abstract: For a distance-regular graph with second largest eigenvalue (resp. smallest eigenvalue) mu1 (resp. muD) we show that (mu1+1)(muD+1)<= -b1 holds, where equality only holds when the diameter equals two. Using this inequality we study distance-regular graphs with fixed second largest eigenvalue.

Recommendations

• The distance-regular graphs such that all of its second largest local eigenvalues are at most one
• Some results on the eigenvalues of distance-regular graphs
• Regular graphs whose second largest eigenvalue is at most 1
• An inequality for regular near polygons
• On the second largest distance eigenvalue

Cites work

• A family of antipodal distance-regular graphs related to the classical Preparata codes
• Cubic Distance-Regular Graphs
• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Interlacing eigenvalues and graphs
• Shilla distance-regular graphs
• The distance-regular graphs of valency four
• There are only finitely many distance-regular graphs of fixed valency greater than two
• Tight distance-regular graphs

Cited in

(25)

• Distance-regular Shilla graphs with b₂ = c₂
• An inequality for regular near polygons
• On the least distance eigenvalues of the second power of a graph
• An inequality involving the local eigenvalues of a distance-regular graph
• 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
• On bounding the diameter of a distance-regular graph
• Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles
• Codes in Shilla distance-regular graphs
• Distance-regular graphs without 4-claws
• 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
• Twice Q-polynomial distance-regular graphs of diameter 4
• Eigenvectors of Distance-Regular Graphs
• A Cheeger inequality of a distance regular graph using Green's function
• 2-walk-regular graphs with a small number of vertices compared to the valency
• A relationship between the second largest eigenvalue and local valency of an edge-regular graph
• The distance-regular graphs such that all of its second largest local eigenvalues are at most one
• Distance-regular graphs with a few q-distance eigenvalues
• Distance-regular graphs with or at least half the valency
• Examples of diameter-2 graphs with no triangle or \(K_{2,t}\)
• More balancing for distance-regular graphs
• There are only finitely many distance-regular graphs with valency \(k\) at least three, fixed ratio \(\frac{k_2}{k}\) and large diameter
• Non-geometric distance-regular graphs of diameter at least 3 with smallest eigenvalue at least -3
• The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)

This page was built for publication: An inequality involving the second largest and smallest eigenvalue of a distance-regular graph

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