Chromatic number and signless Laplacian spectral radius of graphs

DOI10.22108/toc.2021.129720.1876OpenAlexW4372313385MaRDI QIDQ5104011

Mohammad Reza Oboudi

Publication date: 9 September 2022

Full work available at URL: https://doaj.org/article/672a9ba454684d3e96e737b660f47b5e

zbMATH Keywords

chromatic numbermajorizationsignless Laplacian matrixsignless Laplacian spectral radius

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the third largest eigenvalue of graphs
• Signless Laplacian spectral radii of graphs with given chromatic number
• Majorization and the spectral radius of starlike trees
• Lower bounds for the clique and the chromatic numbers of a graph
• Chromatic number and spectral radius
• Spectral bounds for the clique and independence numbers of graphs
• A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization
• Distance spectral radius of complete multipartite graphs and majorization
• Eigenvalue bounds for the signless laplacian
• The Eigenvalues of a Graph and Its Chromatic Number
• Inequalities: theory of majorization and its applications

This page was built for publication: Chromatic number and signless Laplacian spectral radius of graphs