Upper bounds for domination related parameters in graphs on surfaces

详细信息    查看全文

• 作者：Vladimir Samodivkin ^{vl.samodivkin@gmail.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Total/(weakly) connected domination number ; (Total) restrained/Roman bondage number ; Euler characteristic ; Orientable/nonorientable genus
• 刊名：?AKCE International Journal of Graphs and Combinatorics
• 出版年：2016
• 出版时间：August 2016
• 年：2016
• 卷：13
• 期：2
• 页码：140-145
• 全文大小：232 K

文摘

In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic. We also present upper bounds for the restrained bondage number, the total restrained bondage number and the restricted edge connectivity of graphs in terms of the orientable/nonorientable genus and maximum degree.