A bound on the Laplacian spread which is tight for strongly regular graphs

DOI10.1016/j.laa.2015.12.014zbMath1331.05144OpenAlexW2237474482MaRDI QIDQ252596

Fan-Hsuan Lin, Chih-Wen Weng

Publication date: 3 March 2016

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

Full work available at URL: https://doi.org/10.1016/j.laa.2015.12.014

zbMATH Keywords

strongly regular graphLaplacian matrixLaplacian spread

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items

A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph, A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• The Laplacian spread of unicyclic graphs
• Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs
• The minimum Laplacian spread of unicyclic graphs
• A note on Laplacian graph eigenvalues
• Two sharp upper bounds for the Laplacian eigenvalues.
• An always nontrivial upper bound for Laplacian graph eigenvalues
• The Laplacian spread of tricyclic graphs
• A note on the upper bounds for the Laplacian spectral radius of graphs
• Eigenvalues of the Laplacian of a graph^∗
• The Laplacian Spectrum of a Graph II
• de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph