On 3-chromatic distance-regular graphs

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

Research output: Book/ReportReportAcademic

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 lambda < 1.
Original languageEnglish
Place of PublicationTilburg
PublisherTilburg University
Number of pages14
Publication statusPublished - 2006

Publication series

NameCenter Discussion Paper
Volume2006-120

Fingerprint Dive into the research topics of 'On 3-chromatic distance-regular graphs'. Together they form a unique fingerprint.

Cite this