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

The Lower Bounds on Strong Signed Domination Number of a Graph

作　　者：卢君龙[1] 吕新忠[1] 

机构地区：[1]浙江师范大学数理与信息工程学院,浙江金华321004

出　　处：《甘肃联合大学学报（自然科学版）》2012年第2期6-9,共4页Journal of Gansu Lianhe University :Natural Sciences

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

摘　　要：图G的强符号控制数γss(G)有着许多重要的应用背景,因此确定其下界有重要意义.本文在图的符号控制数基础上对图的强符号控制数进行了研究,指出了文献[3]定理5的小错误,改进了文献[4]定理4的下界,给出了图的强符号控制数的3个独立的下界,并给出了达到这3个下界的图.The strong signed domination number of a graph has its important applying background,so it is useful to investigate the lower bounds of it.In this paper the strong signed domination number of a graph was studied,mistake of theorem 5 of literature 3 was poimed out and the lower bounds of theorem 4 of literature 4 was improved,three lower bounds of strong signed domination number were obtained,and give some graphs which attain these three bounds respectively weregiven.

关 键 词：强符号控制数 强符号控制函数 下界 

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