摘要
图的符号控制数的研究有许多应用背景 .但图的符号控制数的计算是NP完全问题 ,因而确定其上下界有重大意义 .本文在 [5 ]的基础上 ,引进了新参数δ (G) ,全面改进了 [5 ]所给出的符号控制数的下界 ,并给出了一些可达下界的图 .
The signed domiation number has its applying background. The decision problem corresponding to the problem of computing it is NP-complete. So it is usefull to investigate the bounds of it. In this paper, we study the signed domination number graph, and obtain some new lower bounds of signed domination number of a graph represented by the new parameter δ (G), and show that these lower bounds are better than those in , and give some graphs which attain the bounds.
出处
《数学杂志》
CSCD
北大核心
2002年第2期169-173,共5页
Journal of Mathematics
基金
国家自然科学基金资助项目 (198710 34)
关键词
图
符号控制函数
符号控制数
Graphs
The signed domintion funciton
The signed domination number
