DOI
https://doi.org/10.25772/EZSN-X414
Author ORCID Identifier
0000-0002-8294-1423
Defense Date
2021
Document Type
Dissertation
Degree Name
Doctor of Philosophy
Department
Systems Modeling and Analysis
First Advisor
Richard Hammack
Second Advisor
Dewey Taylor
Third Advisor
Craig Larson
Fourth Advisor
David Edwards
Abstract
We investigate a number of open problems related to products of palindromic graphs. The notion of a palindromic graph was defined by Robert Beeler. A graph G on n vertices is palindromic if there is a vertex-labeling bijection f:V(G) -> {1,..,n} with the property that for any edge vw in E(G), there is an edge xy in E(G) for which f(x)=n-f(v)+1 and f(y)=n-f(w)+1.
Rights
© Jamie Shive
Is Part Of
VCU University Archives
Is Part Of
VCU Theses and Dissertations
Date of Submission
8-9-2021
COinS