Date of Award
2016
Document Type
Dissertation
Degree Name
Ph.D. in Mathematics
Department
Mathematics
First Advisor
Bing Wei
Second Advisor
Dawn Wilkins
Third Advisor
Haidong Wu
Relational Format
dissertation/thesis
Abstract
Let G be a simple graph. The independent domination number i(G) is the minimum cardinality among all maximal independent sets of G. A graph is subcubic whenever the maximum degree is at most three. In this paper, we will show that the independent domination number of a connected subcubic graph of order n having minimum degree at least two is at most 3(n+1)/7, providing a sharp upper bound for subcubic connected graphs with minimum degree at least two.
Recommended Citation
Priddy, Bruce Allan, "Independent Domination Of Subcubic Graphs" (2016). Electronic Theses and Dissertations. 673.
https://egrove.olemiss.edu/etd/673