A bound on the Laplacian spread which is tight for strongly regular graphs
DOI10.1016/J.LAA.2015.12.014zbMATH Open1331.05144OpenAlexW2237474482MaRDI QIDQ252596FDOQ252596
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30)
Cites Work
- 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
- A course in combinatorics.
- Title not available (Why is that?)
- Eigenvalues of the Laplacian of a graph∗
- Title not available (Why is that?)
- The Laplacian Spectrum of a Graph II
- Title not available (Why is that?)
- Title not available (Why is that?)
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
- 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
Cited In (3)
This page was built for publication: A bound on the Laplacian spread which is tight for strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q252596)