Independent Domination Of Subcubic Graphs

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.

Name thesis:degree_name

Ph.D. in Mathematics

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Mathematics

Year dc:date.available

2016

Author dc:creator

• Priddy, Bruce Allan

Contributors dc:contributor

• Bing Wei
• Dawn Wilkins
• Haidong Wu

• Bondage
• Domination
• Extremal Graph Theory
• Independent Bondage
• Independent Domination
• Mathematics

Repository record dc:identifier

https://egrove.olemiss.edu/etd/673

OAI identifier oai:identifier

oai:egrove.olemiss.edu:etd-1672