首页 | 本学科首页   官方微博 | 高级检索  
     检索      

关于图的强符号控制数的下界
引用本文:卢君龙,吕新忠.关于图的强符号控制数的下界[J].甘肃联合大学学报(自然科学版),2012(2):6-9.
作者姓名:卢君龙  吕新忠
作者单位:浙江师范大学数理与信息工程学院
基金项目:国家自然科学基金(10971198)
摘    要:图G的强符号控制数γss(G)有着许多重要的应用背景,因此确定其下界有重要意义.本文在图的符号控制数基础上对图的强符号控制数进行了研究,指出了文献3]定理5的小错误,改进了文献4]定理4的下界,给出了图的强符号控制数的3个独立的下界,并给出了达到这3个下界的图.

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

The Lower Bounds on Strong Signed Domination Number of a Graph
LU Jun-long,LV Xin-zhong.The Lower Bounds on Strong Signed Domination Number of a Graph[J].Journal of Gansu Lianhe University :Natural Sciences,2012(2):6-9.
Authors:LU Jun-long  LV Xin-zhong
Institution:(School of Mathematics,Physics and Information Engineering, Zhejiang Normal University,Jinhua 321004,China)
Abstract: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.
Keywords:the strong signed domination number  the strong signed domination function  lower bounds
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号