Back to search

Clemson University

Problems in Domination and Graph Products

Abstract

dc:description.abstract

The 'domination chain,'' first proved by Cockayne, Hedetniemi, and Miller in 1978, has been the focus of much research. In this work, we continue this study by considering unique realizations of its parameters. We first consider unique minimum dominating sets in Cartesian product graphs. Our attention then turns to unique minimum independent dominating sets in trees, and in some direct product graphs. Next, we consider an extremal graph theory problem and determine the maximum number of edges in a graph having a unique minimum independent dominating set or a unique minimum maximal irredundant set of cardinality two. Finally, we consider a variation of domination, called identifying codes, in the Cartesian product of a complete graph and a path.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (PhD)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematical Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Hedetniemi, Jason Todd
Contributors dc:contributor
  • Dr. Kevin James, Committee Chair
  • Dr. Doug Rall
  • Dr. Wayne Goddard
  • Dr. Hui Xue

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_dissertations/1640

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Hedetniemi, Jason Todd. Problems in Domination and Graph Products. Dissertation thesis, https://open.clemson.edu/all_dissertations/1640