Abstract
dc:description.abstractAn 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 × 8Rights
dc:rights- Statement dc:rights
-
- Ben MacKinnon
Identifiers
dc:identifier.*- Identifier
- https://scholarscompass.vcu.edu/etd/4609