Prefer a chat interface with context about you and your work?
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.