Vipul: Created page with "{{undirected graph family}} ==Definition== The $n$ -dimensional hyperoctahedron graph can be defined in the following equivalent ways: # It is the graph whose ver..."

2012-05-29T16:47:36Z

Created page with "{{undirected graph family}} ==Definition== The <math>n</math>-dimensional hyperoctahedron graph can be defined in the following equivalent ways: # It is the graph whose ver..."

New page

{{undirected graph family}}

==Definition==

The <math>n</math>-dimensional hyperoctahedron graph can be defined in the following equivalent ways:

# It is the graph whose vertices and edges are respectively the vertices and edges of the <math>n</math>-dimensional hyperoctahedron.
# It is the [[complement of a graph|complement]] of a [[matching graph]] on <math>2n</math> vertices, i.e., a graph that comprises <math>n</math> vertex-disjoint edges.

Hyperoctahedron graph - Revision history

Vipul: Created page with "{{undirected graph family}} ==Definition== The n-dimensional hyperoctahedron graph can be defined in the following equivalent ways: # It is the graph whose ver..."

Vipul: Created page with "{{undirected graph family}} ==Definition== The $n$ -dimensional hyperoctahedron graph can be defined in the following equivalent ways: # It is the graph whose ver..."