On 3-chromatic distance-regular graphs

A. Blokhuis; A.E. Brouwer; W.H. Haemers

doi:10.1007/s10623-007-9100-7

On 3-chromatic distance-regular graphs

A. Blokhuis, A.E. Brouwer, W.H. Haemers

Discrete Algebra and Geometry

Research output: Contribution to journal › Article › Academic › peer-review

4 Citations (Scopus)

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.

Original language	English
Pages (from-to)	293-305
Journal	Designs, Codes and Cryptography
Volume	44
Issue number	1-3
DOIs	https://doi.org/10.1007/s10623-007-9100-7
Publication status	Published - 2007

Access to Document

10.1007/s10623-007-9100-7

Cite this

@article{1de6dd3230234929822a9c3a556772b1,

title = "On 3-chromatic distance-regular graphs",

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.",

author = "A. Blokhuis and A.E. Brouwer and W.H. Haemers",

year = "2007",

doi = "10.1007/s10623-007-9100-7",

language = "English",

volume = "44",

pages = "293--305",

journal = "Designs, Codes and Cryptography",

issn = "0925-1022",

publisher = "Springer",

number = "1-3",

}

TY - JOUR

T1 - On 3-chromatic distance-regular graphs

AU - Blokhuis, A.

AU - Brouwer, A.E.

AU - Haemers, W.H.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

U2 - 10.1007/s10623-007-9100-7

DO - 10.1007/s10623-007-9100-7

M3 - Article

SN - 0925-1022

VL - 44

SP - 293

EP - 305

JO - Designs, Codes and Cryptography

JF - Designs, Codes and Cryptography

IS - 1-3

ER -

On 3-chromatic distance-regular graphs

Abstract

Access to Document

Fingerprint

Cite this