Back to search

Virginia Commonwealth University

The Automorphism Group of the Halved Cube

Abstract

dc:description.abstract

An n-dimensional halved cube is a graph whose vertices are the binary strings of length n, where two vertices are adjacent if and only if they differ in exactly two positions. It can be regarded as the graph whose vertex set is one partite set of the n-dimensional hypercube, with an edge joining vertices at hamming distance two. In this thesis we compute the automorphism groups of the halved cubes by embedding them in R n and realizing the automorphism group as a subgroup of GLn(R). As an application we show that a halved cube is a circulant graph if and only if its dimension of is at most four.

Degree

thesis:*
Name thesis:degree_name
Master of Science
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • MacKinnon, Benjamin B
Contributors dc:contributor
  • Dr. Richard Hammack
  • Dr. Dewey Taylor
  • Dr. Paul Brooks

Subjects

dc:subject × 8

Rights

dc:rights
Statement dc:rights
  • Ben MacKinnon

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Virginia Commonwealth University
Base URL
scholarscompass.vcu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

MacKinnon, Benjamin B. The Automorphism Group of the Halved Cube. Thesis thesis, https://doi.org/10.25772/VZQ4-B598