The odd graph On has one vertex for each of the (n &minus; 1)-element subsets of a (2n &minus; 1)-element set.
The generalized odd graphs include the odd graphs and the folded cube graphs, and are defined as distance-regular graphs with diameter n &minus; 1 and odd girth 2n &minus; 1 for some n [REF].