Article thumbnail

On 3-Chromatic Distance-Regular Graphs

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

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.

Publisher: Operations research
Year: 2006
OAI identifier: oai:wo.uvt.nl:198498
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://repository.uvt.nl/id/ir... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.