Title of article :
The chromatic number and rank of the complements of the Kasami graphs
Author/Authors :
Aidan Roy، نويسنده , , Gordon F. Royle، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2007
Abstract :
We determine the rank and chromatic number of the complements of all Kasami graphs, some of which form an infinite family of counterexamples to the now disproven rank-coloring conjecture.
Keywords :
Kasami graph , Distance-regular graph , Chromatic number , Deterministic communication complexity , Rank
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
