A b stractIn this article we study some variants of the domination concept attending to the connectivity of the subgraph generated by the dominant set. This study is restricted to maximal outerplanar graphs. We establish tight combinatorial bounds for con nected domination, semitotal domination, independent domination and weakly con nected domination for any n-vertex maximal outerplaner graph.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.