Generalized hypercubes and (0,2)-graphs Original Research Article

A generalized hypercube Qd(S) (S ⊆ {1, 2, …, d}) has {0,1}d as vertex set and two vertices are joined whenever their mutual distance in Qd belongs to S. These graphs have been introduced in (Berrachedi and Mollard, 1996) where the notion mainly investigated there is graph embedding, especially, in the case where the host graph is a hypercube. A simple connected graph G is a (0, 2)-graph if any two vertices have 0 or exactly two common neighbors as introduced in (Mulder, 1980). We give first some results about the structure of generalized hypercubes, and then characterize those of which are (0, 2)-graphs. Using similar construction as in generalized hypercubes, we exhibit a class of (0, 2)-graphs which are not vertex transitive which contradicts again a conjecture of Mulder (1982) on the convexity of interval regular graphs.