Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
Author:
- 1 March 2012
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (5) , 992-998
Abstract
No abstract availableKeywords
Funding Information
- BK21 Math Modeling HRD Div. Sungkyunkwan University, Suwon, Republic of Korea
This publication has 15 references indexed in Scilit:
- Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphsLinear Algebra and its Applications, 2011
- On conjectures involving second largest signless Laplacian eigenvalue of graphsLinear Algebra and its Applications, 2010
- A survey of automated conjectures in spectral graph theoryLinear Algebra and its Applications, 2010
- Towards a spectral theory of graphs based on the signless Laplacian, I2009
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graphLinear Algebra and its Applications, 2008
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given orderLinear and Multilinear Algebra, 2008
- Signless Laplacians of finite graphsLinear Algebra and its Applications, 2007
- Eigenvalue bounds for the signless laplacianPublications de l'Institut Mathematique, 2007
- The Laplacian spectrum of a graphComputers & Mathematics with Applications, 2004
- Sharp lower bounds on the Laplacian eigenvalues of treesLinear Algebra and its Applications, 2004