The smallest signless Laplacian spectral radius of graphs with a given clique number

DOI10.1016/j.laa.2013.07.027zbMath1282.05164MaRDI QIDQ2435417

Ting-Zhu Huang, Jing-Ming Zhang, Ji-Ming Guo

Publication date: 19 February 2014

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

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

zbMATH Keywords

clique number; signless Laplacian spectral radius; signless Laplacian characteristic polynomial

Mathematics Subject Classification ID

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

Related Items

Maximizing the least signless Laplacian eigenvalue of unicyclic graphs, Kite graphs determined by their spectra, Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The smallest Laplacian spectral radius of graphs with a given clique number
• Signless Laplacians of finite graphs
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Laplacian graph eigenvectors
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• A connection between ordinary and Laplacian spectra of bipartite graphs
• Towards a spectral theory of graphs based on the signless Laplacian, I
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph