Title of article
Chromatic Number and the 2-Rank of a Graph
Author/Authors
Godsil، نويسنده , , C.D. and Royle، نويسنده , , Gordon F.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
8
From page
142
To page
149
Abstract
We show that if the adjacency matrix of a graph X has 2-rank 2r, then the chromatic number of X is at most 2r+1, and that this bound is tight.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2001
Journal title
Journal of Combinatorial Theory Series B
Record number
1526759
Link To Document