Chromatic number and spectral radius
From MaRDI portal
Publication:996333
DOI10.1016/j.laa.2007.06.005zbMath1125.05063arXivmath/0702723OpenAlexW2018630398MaRDI QIDQ996333
Publication date: 14 September 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0702723
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Coloring of graphs and hypergraphs (05C15)
Related Items
Max \(k\)-cut and the smallest eigenvalue, Colouring the normalized Laplacian, Unnamed Item, Schrödinger operators with δ- and δ′-interactions on Lipschitz surfaces and chromatic numbers of associated partitions, New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix, Unified spectral bounds on the chromatic number, New eigenvalue bound for the fractional chromatic number, Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory, Some applications of a majorization inequality due to Bapat and Sunder, Distance Laplacian eigenvalues and chromatic number in graphs, An inertial lower bound for the chromatic number of a graph, Bounds for the extreme eigenvalues of the Laplacian and signless Laplacian of a graph, Chromatic number and signless Laplacian spectral radius of graphs, Proof of a conjectured lower bound on the chromatic number of a graph, Spectral lower bounds for the quantum chromatic number of a graph, On the Laplacian spectrum of \(k\)-uniform hypergraphs, Some relations between the eigenvalues of adjacency, Laplacian and signless Laplacian matrix of a graph, More tales of Hoffman: bounds for the vector chromatic number of a graph
Cites Work
