Electronic Theses and Dissertations

Date of Award


Document Type


Degree Name

Ph.D. in Mathematics



First Advisor

Bing Wei

Second Advisor

Dawn Wilkins

Third Advisor

Haidong Wu

Relational Format



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.

Included in

Mathematics Commons



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.