Abstract
The vertex set of a halved cube Q′d consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then it is proved that Q′d is the only connected, (d2)-regular graph on 2d-1 vertices in which every edge lies in two d-cliques and two d-cliques do not intersect in a vertex.
| Original language | English |
|---|---|
| Pages (from-to) | 27-32 |
| Number of pages | 6 |
| Journal | Ars combinatoria |
| Volume | 48.1998 |
| Issue number | 2 |
| Publication status | Published - Apr 1998 |