Hamiltonian Strongly Regular Graphs

A.E. Brouwer, W.H. Haemers

Research output: Working paperDiscussion paperOther research output

272 Downloads (Pure)


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
Publication statusPublished - 2008

Publication series

NameCentER Discussion Paper


  • Distance-regular graphs
  • Hamilton cycles JEL-code

Fingerprint Dive into the research topics of 'Hamiltonian Strongly Regular Graphs'. Together they form a unique fingerprint.

Cite this