5-Chromatic Strongly Regular Graphs

N.C. Fiala, W.H. Haemers

Research output: Working paperDiscussion paperOther research output

336 Downloads (Pure)

Abstract

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.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages17
Volume2003-45
Publication statusPublished - 2003

Publication series

NameCentER Discussion Paper
Volume2003-45

Fingerprint

Strongly Regular Graph
Eigenvalue
Chromatic number
Enumeration
Graph in graph theory

Keywords

  • graphs
  • eigenvalues

Cite this

Fiala, N. C., & Haemers, W. H. (2003). 5-Chromatic Strongly Regular Graphs. (CentER Discussion Paper; Vol. 2003-45). Tilburg: Operations research.
Fiala, N.C. ; Haemers, W.H. / 5-Chromatic Strongly Regular Graphs. Tilburg : Operations research, 2003. (CentER Discussion Paper).
@techreport{16d4bde1141a428d9633b3aba28e7ebb,
title = "5-Chromatic Strongly Regular Graphs",
abstract = "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.",
keywords = "graphs, eigenvalues",
author = "N.C. Fiala and W.H. Haemers",
note = "Pagination: 17",
year = "2003",
language = "English",
volume = "2003-45",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Fiala, NC & Haemers, WH 2003 '5-Chromatic Strongly Regular Graphs' CentER Discussion Paper, vol. 2003-45, Operations research, Tilburg.

5-Chromatic Strongly Regular Graphs. / Fiala, N.C.; Haemers, W.H.

Tilburg : Operations research, 2003. (CentER Discussion Paper; Vol. 2003-45).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - 5-Chromatic Strongly Regular Graphs

AU - Fiala, N.C.

AU - Haemers, W.H.

N1 - Pagination: 17

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - graphs

KW - eigenvalues

M3 - Discussion paper

VL - 2003-45

T3 - CentER Discussion Paper

BT - 5-Chromatic Strongly Regular Graphs

PB - Operations research

CY - Tilburg

ER -

Fiala NC, Haemers WH. 5-Chromatic Strongly Regular Graphs. Tilburg: Operations research. 2003. (CentER Discussion Paper).