Download this article
 Download this article For screen
For printing
Recent Issues

Volume 17
Issue 2, 183–362
Issue 1, 1–182

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
Submission guidelines
Submission form
Editorial board
Editors' interests
ISSN (electronic): 1944-4184
ISSN (print): 1944-4176
Author index
To appear
Other MSP journals
Automorphism groups of half cubes

Richard H. Hammack and Benjamin B. MacKinnon

Vol. 16 (2023), No. 2, 321–329

The n-dimensional half cube is the graph whose vertices are the binary strings of length n, 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 n-dimensional polytope (called the half cube polytope) whose cells are (n1)-dimensional simplices and (n1)-dimensional half cube polytopes.

We compute the automorphism groups of the half cube graphs by embedding their vertices in n and realizing the automorphism groups as subgroups of GL n(). As a consequence, the automorphism group of a half cube graph coincides with its automorphism group as a polytope.

half cube, graph automorphism group, hypercube, graph automorphism group
Mathematical Subject Classification
Primary: 05C25, 05C50, 05C99
Received: 28 February 2022
Revised: 4 June 2022
Accepted: 4 June 2022
Published: 26 May 2023

Communicated by Ronald Gould
Richard H. Hammack
Department of Mathematics and Applied Mathematics
Virginia Commonwealth University
Richmond, VA
United States
Benjamin B. MacKinnon
Department of Mathematics
Brightpoint Community College
Midlothian, VA
United States