Hamiltonian strongly regular graphs

A.E. Brouwer; W.H. Haemers

Hamiltonian strongly regular graphs

A.E. Brouwer
, W.H. Haemers

Discrete Algebra and Geometry

Research output: Book/Report › Report › Academic

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 language	English
Place of Publication	Tilburg
Publisher	Tilburg University
Number of pages	5
Publication status	Published - 2008

Publication series

Name	CentER Discussion Paper
Volume	2008-28

Access to Document

https://research.tilburguniversity.edu/en/publications/hamiltonian-strongly-regular-graphs/

Cite this

@book{b82e15d0165543cf8c5ff39338ca94d6,

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.",

author = "A.E. Brouwer and W.H. Haemers",

year = "2008",

language = "English",

series = "CentER Discussion Paper",

publisher = "Tilburg University",

}

TY - BOOK

T1 - Hamiltonian strongly regular graphs

AU - Brouwer, A.E.

AU - Haemers, W.H.

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.

M3 - Report

T3 - CentER Discussion Paper

BT - Hamiltonian strongly regular graphs

PB - Tilburg University

CY - Tilburg

ER -

Hamiltonian strongly regular graphs

Abstract

Publication series

Access to Document

Fingerprint

Cite this