Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
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.
On Topological Indices And Domination Numbers Of Graphs, Shaohui Wang
On Topological Indices And Domination Numbers Of Graphs, Shaohui Wang
Electronic Theses and Dissertations
Topological indices and dominating problems are popular topics in Graph Theory. There are various topological indices such as degree-based topological indices, distance-based topological indices and counting related topological indices et al. These topological indices correlate certain physicochemical properties such as boiling point, stability of chemical compounds. The concepts of domination number and independent domination number, introduced from the mid-1860s, are very fundamental in Graph Theory. In this dissertation, we provide new theoretical results on these two topics. We study k-trees and cactus graphs with the sharp upper and lower bounds of the degree-based topological indices(Multiplicative Zagreb indices). The extremal cacti …