Hyperoctahedron graph

Definition

The $n$-dimensional hyperoctahedron graph can be defined in the following equivalent ways:

1. It is the graph whose vertices and edges are respectively the vertices and edges of the $n$-dimensional hyperoctahedron.
2. It is the complement of a matching graph on $2n$ vertices, i.e., a graph that comprises $n$ vertex-disjoint edges.