Abstract
dc:description.abstractIn this thesis, we introduce Roman domination cover rubbling as an extension of domination cover rubbling. We define a parameter on a graph $G$ called the \textit{Roman domination cover rubbling number}, denoted \rhoR(G), as the smallest number of pebbles, so that from any initial configuration of those pebbles on $G$, it is possible to obtain a configuration which is Roman dominating after some sequence of pebbling and rubbling moves. We begin by characterizing graphs $G$ having small \rhoR(G) value. Among other things, we also obtain the Roman domination cover rubbling number for paths and give an upper bound for the Roman domination cover rubbling number of a tree.
Degree
thesis:*- Name thesis:degree_name
- MS (Master of Science)
- Level thesis:degree_level
- Thesis - unrestricted
- Discipline thesis:degree_discipline
- Mathematical Sciences
- Grantor dc:publisher
- East Tennessee State University
- Year dc:date.issued
- 2019
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Carney, Nicholas
Subjects
dc:subject × 5Rights
dc:rights- Statement dc:rights
-
- Nicholas Carney
- Language dc:language
- eng
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://dc.etsu.edu/etd/3617