The least signless Laplacian eignvalue of the complements of unicyclic graphs
Authors:
- Gui-Dong YuGYGui-Dong Yu
- Yi-Zheng FanYFYi-Zheng Fan
- Miao-Lin YeMYMiao-Lin Ye
Open Access
- 1 August 2017
- journal article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 306, 13-21
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Towards a spectral theory of graphs based on the signless Laplacian, IILinear Algebra and its Applications, 2010
- Graphs with maximal signless Laplacian spectral radiusLinear Algebra and its Applications, 2010
- Towards a spectral theory of graphs based on the signless Laplacian, IIIApplicable Analysis and Discrete Mathematics, 2010
- The Signless Laplacian Spectral Radius of Graphs with Given Number of Pendant VerticesGraphs and Combinatorics, 2009
- 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
- Enumeration of cospectral graphsEuropean Journal of Combinatorics, 2004
- Algebraic graph theory without orientationLinear Algebra and its Applications, 1994