On 3-chromatic distance-regular graphs |
| |
| Authors: | Aart Blokhuis Andries E Brouwer Willem H Haemers |
| |
| Institution: | 1. Department of Mathematics, Technological University Eindhoven, Eindhoven, The Netherlands
2. Department of Econometrics & O.R., Tilburg University, Tilburg, The Netherlands
|
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
