MS (Master of Science)
Date of Award
Committee Chair or Co-Chairs
Teresa W. Haynes
Anant P. Godbole, Debra J. Knisley
In a graph G=(V,E), a subset S ⊆ V is a double dominating set if every vertex in V is dominated at least twice. The minimum cardinality of a double dominating set of G is the double domination number. A graph G is double domination edge critical if for any edge uv ∈ E(G̅), the double domination number of G+uv is less than the double domination number of G. We investigate properties of double domination edge critical graphs. In particular, we characterize the double domination edge critical trees and cycles, graphs with double domination numbers of 3, and graphs with double domination numbers of 4 with maximum diameter.
Thesis - Open Access
Thacker, Derrick Wayne, "Double Domination Edge Critical Graphs." (2006). Electronic Theses and Dissertations. Paper 2177. http://dc.etsu.edu/etd/2177
Copyright by the authors.