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

DOI10.7151/DMGT.1718zbMath1292.05180OpenAlexW2025300702MaRDI QIDQ2442271

Li Su, Jing Zhang, Hong-Hai Li

Publication date: 2 April 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1718

zbMATH Keywords

spectral radiusclique numbersignless Laplaciankite graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (5)

Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter ⋮ Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter ⋮ The \(Q\)-minimizer graph with given independence number ⋮ Kite graphs determined by their spectra ⋮ On the \(A_\alpha\)-spectral radius of a graph

Cites Work

• Unnamed Item
• On the Laplacian coefficients of acyclic graphs
• Signless Laplacians of finite graphs
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• Properties of spectra of graphs and line graphs
• Towards a spectral theory of graphs based on the signless Laplacian, I
• A Survey on Spectra of infinite Graphs

This page was built for publication: The minimum spectral radius of signless Laplacian of graphs with a given clique number