Vertex-Addition Strategy for Domination-Like Invariants

Electronic Journal Of Combinatorics

Michitaka Furuya¹ 

关键词: Domination;    Total domination;    Roman domination;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

In [J. Graph Theory 13 (1989) 749—762], McCuaig and Shepherd gave an upper bound of the domination number for connected graphs with minimum degree at least two. In this paper, we propose a simple strategy which, together with the McCuaig-Shepherd theorem,

【 授权许可】

Others