The
-dimensional
half cube is the graph whose vertices are the binary strings of length
,
with an even number of 1’s, and with two vertices adjacent if and only
if they differ in exactly two positions. It is also the 1-skeleton of an
-dimensional
polytope (called the
half cube polytope) whose cells are
-dimensional simplices
and
-dimensional
half cube polytopes.
We compute the automorphism groups of the half cube graphs by embedding their
vertices in
and realizing the automorphism groups as subgroups of
. As a
consequence, the automorphism group of a half cube graph coincides with its
automorphism group as a polytope.
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.81
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.