Back to search

Virginia Commonwealth University

The Inner Power of a Graph

Abstract

dc:description.abstract

We define a new graph operation called the inner power of a graph. The construction is similar to the direct power of graphs, except that factors are intertwined in such a way that certain structural properties of graphs are more clearly reflected in their inner powers. We investigate various properties of inner powers, such as connectivity, bipartiteness, and their interaction with the direct product. We explore possible connections between inner powers and the problem of cancellation over the direct product of graphs.

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
  • Livesay, Neal
Contributors dc:contributor
  • Richard Hammack

Subjects

dc:subject × 5

Rights

dc:rights
Statement dc:rights
  • © The Author

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

Livesay, Neal. The Inner Power of a Graph. Thesis thesis, https://doi.org/10.25772/APHD-DJ85