Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Independent Domination Of Subcubic Graphs, Bruce Allan Priddy
Independent Domination Of Subcubic Graphs, Bruce Allan Priddy
Electronic Theses and Dissertations
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.