Lower bounds on several versions of signed domination number

Lower bounds on several versions of signed domination number
复制标题

DOI:
10.1016/j.disc.2006.09.050
复制
发表时间:
2008-05
期刊:
Discret. Math.
影响因子:
--
通讯作者:
Weidong Chen;E. Song
Weidong Chen;E. Song
中科院分区:
其他
文献类型:
--
作者:
Weidong Chen;E. Song

文献摘要

被引文献

相似文献

研究了图中关于控制的3个数值不变量,即有符号控制数γs、k-子控制数γk和有符号总控制数γst。对于任意图,都给出了γs、γ k3和γst的下界,其中一些下界推广了已知的γs、γ k3和γst的下界,而另一些则被认为是新的下界。还证明了这些边界是尖锐的。
Three numerical invariants of graphs concerning domination, which are named the signed domination number γs, the k-subdomination number γksand the signed total domination number γst, are studied in this paper. For any graph, some lower bounds on γs, γksand γstare presented, some of which generalize several known lower bounds on γs, γksand γst, while others are considered as new. It is also shown that these bounds are sharp.