Hamiltonian Strongly Regular Graphs

A.E. Brouwer, W.H. Haemers

Research output: Working paperDiscussion paperOther research output

219 Downloads (Pure)

Abstract

We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages6
Volume2008-28
Publication statusPublished - 2008

Publication series

NameCentER Discussion Paper
Volume2008-28

Fingerprint

Petersen Graph
Strongly Regular Graph
Distance-regular Graph
Sufficient Conditions

Keywords

  • Distance-regular graphs
  • Hamilton cycles JEL-code

Cite this

Brouwer, A. E., & Haemers, W. H. (2008). Hamiltonian Strongly Regular Graphs. (CentER Discussion Paper; Vol. 2008-28). Tilburg: Operations research.
Brouwer, A.E. ; Haemers, W.H. / Hamiltonian Strongly Regular Graphs. Tilburg : Operations research, 2008. (CentER Discussion Paper).
@techreport{7f122a6450e34257b62bd56ee0f47bbf,
title = "Hamiltonian Strongly Regular Graphs",
abstract = "We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.",
keywords = "Distance-regular graphs, Hamilton cycles JEL-code",
author = "A.E. Brouwer and W.H. Haemers",
note = "Pagination: 6",
year = "2008",
language = "English",
volume = "2008-28",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Brouwer, AE & Haemers, WH 2008 'Hamiltonian Strongly Regular Graphs' CentER Discussion Paper, vol. 2008-28, Operations research, Tilburg.

Hamiltonian Strongly Regular Graphs. / Brouwer, A.E.; Haemers, W.H.

Tilburg : Operations research, 2008. (CentER Discussion Paper; Vol. 2008-28).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Hamiltonian Strongly Regular Graphs

AU - Brouwer, A.E.

AU - Haemers, W.H.

N1 - Pagination: 6

PY - 2008

Y1 - 2008

N2 - We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.

AB - We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.

KW - Distance-regular graphs

KW - Hamilton cycles JEL-code

M3 - Discussion paper

VL - 2008-28

T3 - CentER Discussion Paper

BT - Hamiltonian Strongly Regular Graphs

PB - Operations research

CY - Tilburg

ER -

Brouwer AE, Haemers WH. Hamiltonian Strongly Regular Graphs. Tilburg: Operations research. 2008. (CentER Discussion Paper).