5-Chromatic Strongly Regular Graphs

In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5.Using eigenvalue techniques, we show that there are at most 43 possible parameter sets for such a graph.For each parameter set, we must decide which strongly regular graphs, if any, possessing the set are 5-chromatic.In this way, we deal completely with 34 of these parameter sets using eigenvalue techniques and computer enumerations.

MoreLess

Year of publication:	2003
Authors:	Fiala, N.C. ; Haemers, W.H.
Institutions:	Tilburg University, Center for Economic Research
Subject:	graphs \| eigenvalues

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 2003-45
Source:	RePEc - Research Papers in Economics

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