Signless Laplacian spectral radii of graphs with given chromatic number
From MaRDI portal
Publication:551304
DOI10.1016/j.laa.2011.03.018zbMath1221.05244OpenAlexW2093376397MaRDI QIDQ551304
Guanglong Yu, Yarong Wu, Jin-Long Shu
Publication date: 15 July 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.03.018
Related Items
Signless Laplacian spectral characterization of some disjoint union of graphs ⋮ Seidel energy of complete multipartite graphs ⋮ On a conjecture related to the smallest signless Laplacian eigenvalue of graphs ⋮ Sharp bounds for the signless Laplacian spectral radius in terms of clique number ⋮ \(Q\)-integral complete \(r\)-partite graphs ⋮ Refinement on Spectral Turán’s Theorem ⋮ Maximum degree and spectral radius of graphs in terms of size ⋮ The signless Laplacian spectral radius of graphs with a prescribed number of edges ⋮ The least eigenvalue of signless Laplacian of graphs under perturbation ⋮ Remarks on \(Q\)-integral complete multipartite graphs ⋮ A conjecture on the diameter and signless Laplacian index of graphs ⋮ A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization ⋮ Distance Laplacian eigenvalues and chromatic number in graphs ⋮ On the signless Laplacian index and radius of graphs ⋮ On the spectrum of an equitable quotient matrix and its application ⋮ Chromatic number and signless Laplacian spectral radius of graphs ⋮ On the smallest signless Laplacian eigenvalue of graphs ⋮ Distance spectral radius of complete multipartite graphs and majorization ⋮ On the \((Q\)-)index of 2-domination critical graphs ⋮ The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number
Cites Work
- Unnamed Item
- Signless Laplacians of finite graphs
- Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
- Bounds on the index of the signless Laplacian of a graph
- An improved bound on the minimal number of edges in color-critical graphs
- Which graphs are determined by their spectrum?
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
- Unzerlegbare, nicht negative Matrizen
- Towards a spectral theory of graphs based on the signless Laplacian, I
This page was built for publication: Signless Laplacian spectral radii of graphs with given chromatic number