Unified spectral bounds on the chromatic number

DOI10.7151/dmgt.1835zbMath1326.05080arXiv1210.7844OpenAlexW2964340196MaRDI QIDQ891325

Clive Elphick, Paweł Wocjan

Publication date: 17 November 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.7844

zbMATH Keywords

chromatic numbermajorization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ Distance Laplacian eigenvalues and chromatic number in graphs ⋮ An inertial lower bound for the chromatic number of a graph ⋮ Spectral lower bounds for the orthogonal and projective ranks of a graph ⋮ Spectral lower bounds for the quantum chromatic number of a graph ⋮ More tales of Hoffman: bounds for the vector chromatic number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
• The smallest eigenvalue of the signless Laplacian
• Chromatic number and spectral radius
• Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory

This page was built for publication: Unified spectral bounds on the chromatic number