Total outer-connected domination in trees
暂无分享,去创建一个
Let G = (V, E) be a graph. Set D ⊆ V (G) is a total outerconnected dominating set of G if D is a total dominating set in G and G[V (G)−D] is connected. The total outer-connected domination number of G, denoted by γtc(G), is the smallest cardinality of a total outer-connected dominating set of G. We show that if T is a tree of order n, then γtc(T ) ≥ d 2n 3 e. Moreover, we constructively characterize the family of extremal trees T of order n achieving this lower bound.
[1] Johannes H. Hattingh,et al. Restrained domination in trees , 2000, Discret. Math..
[2] Ermelinda DeLaViña,et al. On Total Domination in Graphs , 2012 .
[3] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[4] Johannes H. Hattingh,et al. Total restrained domination in trees , 2007, Discret. Math..
[5] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .