The vertex set of a halved cube Q", consists of a bipartition vertex set of a cube Q., and two
vertices are adjacent if they have a common neighbour in the cube. Let d> 5. Then it is
proved that Q, is the only connected,(:)-regular graph on 2" T" vertices in which every edge
lies in two d-cliques and two d-cliques do not intersect in a vertex.