Proof of a conjectured lower bound on the chromatic number of a graph
Authors:
- Tsuyoshi AndoTATsuyoshi Ando
- Minghua LinMLMinghua Lin
- 1 November 2015
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 485, 480-484
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- New Spectral Bounds on the Chromatic Number Encompassing all Eigenvalues of the Adjacency MatrixThe Electronic Journal of Combinatorics, 2013
- Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theoryJournal of Mathematical Sciences, 2011
- Chromatic number and spectral radiusLinear Algebra and its Applications, 2007