Maximizing the least signless Laplacian eigenvalue of unicyclic graphs

DOI10.1016/j.laa.2016.12.041zbMath1357.05081MaRDI QIDQ512051

Ji-Ming Guo, Jin-Song Shi, Ji-Yun Ren

Publication date: 23 February 2017

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

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

zbMATH Keywords

eigenvector; signless Laplacian matrix; signless Laplacian characteristic polynomial; the least signless Laplacian eigenvalue

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings

Cites Work

• Unnamed Item
• Unnamed Item
• The smallest eigenvalue of the signless Laplacian
• Signless Laplacians of finite graphs
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Laplacian graph eigenvectors
• Which graphs are determined by their spectrum?
• The least eigenvalue of signless Laplacian of graphs under perturbation
• The least eigenvalue of the signless Laplacian of the complements of trees
• The smallest signless Laplacian spectral radius of graphs with a given clique number
• A lower bound on the least signless Laplacian eigenvalue of a graph
• Eigenvalue bounds for the signless laplacian
• Towards a spectral theory of graphs based on the signless Laplacian, I
• Towards a spectral theory of graphs based on the signless Laplacian, III
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph