Back to search

Virginia Commonwealth University

Parity Domination in Product Graphs

Abstract

dc:description.abstract

An odd open dominating set of a graph is a subset of the graph’s vertices with the property that the open neighborhood of each vertex in the graph contains an odd number of vertices in the subset. An odd closed r-dominating set is a subset of the graph’s vertices with the property that the closed r-ball centered at each vertex in the graph contains an odd number of vertices in the subset. We first prove that the n-fold direct product of simple graphs has an odd open dominating set if and only if each factor has an odd open dominating set. Secondly, we prove that the n-fold strong product of simple graphs has an odd closed r-dominating set if and only if each factor has an odd closed r-dominating set.

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
  • Whisenant, Christopher
Contributors dc:contributor
  • Dewey Taylor

Subjects

dc:subject × 10

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

Whisenant, Christopher. Parity Domination in Product Graphs. Thesis thesis, https://doi.org/10.25772/9XSA-TJ11