摘要
图G的符号控制数γS(G)有着许多重要的应用背景.已知它的计算是NP-完全问题,因而确定其上下界有重要意义.本文研究了1)一般图G的符号控制数,给出了一个新的下界;2)确定了Cn图的符号控制数的精确值.
The signed domination number of a graph has its important applying background.It is known that computing it is NP-complete,so it is useful to investigate the bounds of it.In this paper,the following two aspects are studied:1)obtaining a new lower bound of the signed domination number of a graph;2)determinating the exact value of γ_S(C_n).
出处
《纯粹数学与应用数学》
CSCD
北大核心
2005年第1期59-61,共3页
Pure and Applied Mathematics
基金
安徽工业大学自选课题项目(数理-03-青-02).
关键词
符号控制函数
符号控制数
Cn图
signed domination function, signed domination numberm, C_n graph
