Journal ArticleOPEN ACCESS

On 3-chromatic distance-regular graphs

Designs, Codes, and Cryptography (2007) 44(1-3) 293-305
DOI: 10.1007/s10623-007-9100-7
8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2007 Springer Science+Business Media, LLC.

Author supplied keywords

Cite

CITATION STYLE

APA

Blokhuis, A., Brouwer, A. E., & Haemers, W. H. (2007). On 3-chromatic distance-regular graphs. Designs, Codes, and Cryptography, 44(1–3), 293–305. https://doi.org/10.1007/s10623-007-9100-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free