Back to search

Virginia Commonwealth University

Palindromic Products

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Systems Modeling and Analysis

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Shive, Jamie
  • <p>0000-0002-8294-1423</p>
Contributors dc:contributor
  • Richard Hammack
  • Dewey Taylor
  • Craig Larson
  • David Edwards

Subjects

dc:subject × 2

Rights

dc:rights
Statement dc:rights
  • © Jamie Shive

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

Shive, Jamie; <p>0000-0002-8294-1423</p>. Palindromic Products. Dissertation thesis, https://doi.org/10.25772/EZSN-X414