图的上符号控制数上界[EB/OL]
北京:中国科技论文在线
它是对O
Favaron在正则图中给出的上符号控制数上界及C
X
Wang和 J
Z
Mao在几乎正则图中给出的上符号控制数上界的一个推广
与唐华军和陈耀军在《上符号控制数》中确立的解相比
) 摘要: 图的上符号控制数上界定义为图极小符号控制函数中权重最大值
本文我们根据最小度最大度等参数改进了上符号控制数的上界
上符号控制数 Huimin Liu
本文的结果更精确 关键词: 符号控制函数
) Abstract: The upper signed domination number of a graph is defined as the maximum weight of a minimal signed dominating function
In this paper, we establish a tight upper bound on the signed domination number
Our result is a generalization of those regular graphs and nearly regular graphs obtained in [O
Favaron, (1996) Signed domination in regular graphs, Discrete Math
158:pp
287–293] and [C
X
Wang, J
Z
Mao, (2001) Some more remarks on domination in cubic graphs, Discrete Math
237:pp
193–197] , respectively
Compared the conclusion in [Huajun Tang, Yaojun Chen, (2008) Upper signed domination number, Discrete Math
308:pp
3416-3419], the result in this paper is more precise
Keywords: Signed dominating function ; Upper bound; Upper signed domination number 下载PDF阅读器 PDF全文下载: 修改稿 1( 41 ) 初稿 ( 88 ) 作者简介: 通信联系人: 【收录情况】 中国科技论文在线: 刘惠敏
陈学刚 ( 华北电力大学数理学院
上界
总览 评价 刘惠敏
Xuegang Chen ( School of Mathematics & Physics, North China Electric Power University
【详情见下载】