摘要
图的符号控制数在现实生活中有许多应用背景,但图的符号控制数的计算是NP完全问题.给出了一般图G的Double图的符号控制数下界,确定了圈和路的Double图的符号控制数.
The signed domination number has its applying background in real life,but it＇s a NP-complete problem to compute it.In this paper,we obtain the lower bound of the double graph of a general graph,and work out the signed domination numbers of the double graphs of cycle and path.
出处
《河南科技学院学报（自然科学版）》
2012年第4期54-57,共4页
Journal of Henan Institute of Science and Technology(Natural Science Edition)
基金
国家自然科学基金资助项目(11061014)
