On 3-Chromatic Distance-Regular Graphs

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.

MoreLess

Year of publication:	2006
Authors:	Blokhuis, A. ; Brouwer, A.E. ; Haemers, W.H.
Institutions:	Tilburg University, Center for Economic Research
Subject:	distance-regular graphs \| chromatic number

More details

Extent:	application/pdf
Series:	Discussion Paper.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series CentER Discussion Paper Number 2006-120
Classification:	C0 - Mathematical and Quantitative Methods. General
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011092546