摘要
引入了图的符号边全控制的概念,给出了一个连通图G的符号边全控制数γs′t(G)的下限,确定所有n阶树T的最小符号边全控制数,并刻划了满足γs′t(G)=E(G)的所有连通图G,最后还提出了一个关于γs′t(G)上界的猜想.
We introduce the concept of signed edge total domination in graphs, obtain a lower bound for the signed edge total domination numbers of graphs, and determine the smallest signed edge total domination number for all tree of order n, and characterize all connected graphs with γ′_st（G）=｜E（G）｜.In addition, we pose a conjecture about the upper bound of γ′_st（G）.
出处
《数学的实践与认识》
CSCD
北大核心
2009年第5期138-144,共7页
Mathematics in Practice and Theory
基金
国家自然科学基金(10661007)
江西省自然科学基金(2007G2S0715)
关键词
符号边全控制函数
符号边全控制数
树
signed edge total domination function
signed edge total domination number
tree
