Hamiltonian Strongly Regular Graphs

descriptionPublicationkeyboard_double_arrow_right Article , Report , Research , Other literature type , Preprint 01 Jan 2008 Netherlands English Publisher:Elsevier BVJournal:SSRN Electronic Journal (eissn: 1556-5068,

Copyright policy )

Authors: Brouwer, A.E.; Haemers, W.H.;

doi: 10.2139/ssrn.1104963

Hamiltonian Strongly Regular Graphs

- Summary
- Subjects
- Metrics

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.

Country

Netherlands

Related Organizations

Tilburg University
Netherlands
Eindhoven University of Technology
Netherlands
Technical University Eindhoven
Netherlands

Keywords

Hamilton cycles JEL-code, Distance-regular graphs;Hamilton cycles JEL-code, Distance-regular graphs; Hamilton cycles JEL-code, Distance-regular graphs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average