关于图的弱符号控制数的下界  

On the lower bounds of weak signed domination number of a graph

作　　者：尚华辉[1] 苗连英[2] 苗正科[3] 杨星星[2] 

机构地区：[1]永城职业学院基础部,河南永城476600 [2]中国矿业大学数学系,江苏徐州221008 [3]徐州师范大学数学系,江苏徐州221116

出　　处：《纯粹数学与应用数学》2010年第4期691-695,共5页Pure and Applied Mathematics

基　　金：国家自然科学基金(10871166)

摘　　要：图G的弱符号控制数γws(G)有着许多重要的应用背景,因而确定其下界有重要意义.在构造适当点集的基础上,给出了图的弱符号控制数的4个独立的下界,并给出了达到这4个下界的图.The weak signed domination number of a graph has its important applying background,so it is useful to investigate the bounds of it.In this paper,based on construction of suitable vertex sets,we obtain four lower bounds of weak signed domination number,and give some graphs which attain these four bounds respectively.

关 键 词：图 弱符号控制函数 弱符号控制数 

分 类 号：O157.5[理学—数学]