### Abstract

Original language | English |
---|---|

Place of Publication | Tilburg |

Publisher | Operations research |

Number of pages | 6 |

Volume | 2008-28 |

Publication status | Published - 2008 |

### Publication series

Name | CentER Discussion Paper |
---|---|

Volume | 2008-28 |

### Fingerprint

### Keywords

- Distance-regular graphs
- Hamilton cycles JEL-code

### Cite this

*Hamiltonian Strongly Regular Graphs*. (CentER Discussion Paper; Vol. 2008-28). Tilburg: Operations research.

}

**Hamiltonian Strongly Regular Graphs.** / Brouwer, A.E.; Haemers, W.H.

Research output: Working paper › Discussion paper › Other research output

TY - UNPB

T1 - Hamiltonian Strongly Regular Graphs

AU - Brouwer, A.E.

AU - Haemers, W.H.

N1 - Pagination: 6

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.

KW - Distance-regular graphs

KW - Hamilton cycles JEL-code

M3 - Discussion paper

VL - 2008-28

T3 - CentER Discussion Paper

BT - Hamiltonian Strongly Regular Graphs

PB - Operations research

CY - Tilburg

ER -