Article ID Journal Published Year Pages File Type
6423663 Electronic Notes in Discrete Mathematics 2016 6 Pages PDF
Abstract
In 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 connected domination, semitotal domination, independent domination and weakly connected domination for any n-vertex maximal outerplaner graph.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
Authors
, , , ,