On 3-chromatic distance-regular graphs

被引：0
|
作者：
Aart Blokhuis
Andries E. Brouwer
Willem H. Haemers
机构：
[1] Technological University Eindhoven,Department of Mathematics
[2] Tilburg University,Department of Econometrics & O.R.
来源：
Designs, Codes and Cryptography | 2007年 / 44卷
关键词：
Distance-regular graphs; Chromatic number; 05E30; 05C15;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adjacency matrix. For all known distance-regular graphs it is determined whether they are 3-chromatic. A start is made with the classification of 3-chromatic distance-regular graphs, and it is shown that such graphs, if not complete 3-partite, must have λ ≤ 1.
引用
收藏
页码：293 / 305
页数：12
相关论文
共 50 条
12345