摘要
引入了图的符号树控制的概念,给出一个连通图G的符号树控制数γ′T(G)的一个上界和一个下界,说明了这两个界限均是最好可能的,并确定几类特殊图的符号树控制数,这包括了圈、轮图、完全图和完全二部图.
In this paper we introduce the concept of signed tree domination in graphs, we obtain a upper bound and a lower bound of signed tree domination numbers for general graphs G, and show that the two bounds are best possible. In addition, we determine the signed tree domination numbers for some special classes of graphs G, including cycles, wheels, complete graphs and complete bipartite graphs.
出处
《华东交通大学学报》
2008年第2期56-58,共3页
Journal of East China Jiaotong University
基金
国家自然科学基金项目(10661007)
江西省自然科学基金项目(2007GZS0715)
关键词
符号树控制函数
符号树控制数
圈
轮图
完全图
完全二部图
signed tree dominating function, signed tree domination number, cycles, wheels, complete graphs, complete bi-partite 1~7＂aphs
