Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph

DOI10.1080/09720529.2013.878822zbMath1495.05170OpenAlexW2020100449MaRDI QIDQ5069684

No author found.

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2013.878822

zbMATH Keywords

independence numberchromatic numberLaplacian eigenvaluetotal chromatic numbersignless Laplacian eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Laplacian eigenvalue distribution and graph parameters

Cites Work

• A note on the signless Laplacian eigenvalues of graphs
• Note on deleting a vertex and weak interlacing of the Laplacian spectrum
• The Eigenvalues of a Graph and Its Chromatic Number
• Unnamed Item
• Unnamed Item

This page was built for publication: Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph