The minimum spectral radius of signless Laplacian of graphs with a given clique number
From MaRDI portal
Publication:2442271
DOI10.7151/DMGT.1718zbMATH Open1292.05180OpenAlexW2025300702MaRDI QIDQ2442271FDOQ2442271
Authors: Li Su, Jing Zhang, Honghai 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
Recommendations
- The smallest signless Laplacian spectral radius of graphs with a given clique number
- The minimum signless Laplacian spectral radius of graphs with given independence number
- The smallest Laplacian spectral radius of graphs with a given clique number
- On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
- scientific article; zbMATH DE number 5280010
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- On the signless Laplacian spectral radius of some graphs
- The minimal signless Laplacian spectral radius of graphs with diameter \(n-4\)
- The signless Laplacian spectral radius of graphs with given diameter
- Bounds on the distance signless Laplacian spectral radius in terms of clique number
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Signless Laplacians of finite graphs
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- A Survey on Spectra of infinite Graphs
- Properties of spectra of graphs and line graphs
- On the Laplacian coefficients of acyclic graphs
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Title not available (Why is that?)
Cited In (11)
- The clique number and the smallest \(Q\)-eigenvalue of graphs
- Kite graphs determined by their spectra
- The \(Q\)-minimizer graph with given independence number
- The minimal signless Laplacian spectral radius of graphs with diameter \(n-4\)
- On the spectral characterization of kite graphs
- Title not available (Why is that?)
- The smallest Laplacian spectral radius of graphs with a given clique number
- The smallest signless Laplacian spectral radius of graphs with a given clique number
- Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter
- On the \(A_\alpha\)-spectral radius of a graph
- Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter
This page was built for publication: The minimum spectral radius of signless Laplacian of graphs with a given clique number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442271)