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

DOI10.1080/09720529.2013.878822zbMATH Open1495.05170OpenAlexW2020100449MaRDI QIDQ5069684FDOQ5069684

Authors:

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

chromatic numberLaplacian eigenvalueindependence numbertotal chromatic numbersignless Laplacian eigenvalue

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• A note on the signless Laplacian eigenvalues of graphs
• Title not available (Why is that?)
• The Eigenvalues of a Graph and Its Chromatic Number
• Note on deleting a vertex and weak interlacing of the Laplacian spectrum

Cited In (3)

• Laplacian eigenvalue distribution and graph parameters
• Inequalities between the domination number and the chromatic number of a graph
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069684)