Graphs with at most one signless Laplacian eigenvalue exceeding three
Authors:
- 21 January 2014
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 63 (2) , 377-383
Abstract
We determine all connected graphs with at most one signless Laplacian eigenvalue exceeding three.Keywords
This publication has 6 references indexed in Scilit:
- Signless Laplacian eigenvalues and circumference of graphsDiscrete Applied Mathematics, 2013
- Bipartiteness and the least eigenvalue of signless Laplacian of graphsLinear Algebra and its Applications, 2012
- Signless Laplacian spectral radius and HamiltonicityLinear Algebra and its Applications, 2010
- Signless Laplacians of finite graphsLinear Algebra and its Applications, 2007
- On bipartite graphs with small number of laplacian eigenvalues greater than two and threeLinear and Multilinear Algebra, 2000
- The Laplacian Spectrum of a GraphSIAM Journal on Matrix Analysis and Applications, 1990