An odd characterization of the generalized odd graphs
Combinatorics
2012-02-13 v1
Abstract
We show that any connected regular graph with distinct eigenvalues and odd-girth is distance-regular, and in particular that it is a generalized odd graph.
Keywords
Cite
@article{arxiv.1202.2300,
title = {An odd characterization of the generalized odd graphs},
author = {Edwin R. van Dam and Willem H. Haemers},
journal= {arXiv preprint arXiv:1202.2300},
year = {2012}
}