Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs

详细信息    查看全文

• 作者：Santiago Canales ^{scanales@icai.comillas.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Domination ; Maximal Outerplanar Graph ; Connectivity
• 刊名：Electronic Notes in Discrete Mathematics
• 出版年：2016
• 出版时间：October 2016
• 年：2016
• 卷：54
• 期：Complete
• 页码：109-114
• 全文大小：186 K

文摘

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.