Hamiltonian Strongly Regular Graphs

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.

MoreLess

Year of publication:	2008
Authors:	Brouwer, A.E. ; Haemers, W.H.
Institutions:	Tilburg University, Center for Economic Research
Subject:	Distance-regular graphs \| Hamilton cycles

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 2008-28
Source:	RePEc - Research Papers in Economics

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