Currently displaying 1 – 4 of 4

Showing per page

Order by Relevance | Title | Year of publication

Total domination of Cartesian products of graphs

Xinmin Hou — 2007

Discussiones Mathematicae Graph Theory

Let γₜ(G) and γ p r ( G ) denote the total domination and the paired domination numbers of graph G, respectively, and let G □ H denote the Cartesian product of graphs G and H. In this paper, we show that γₜ(G)γₜ(H) ≤ 5γₜ(G □ H), which improves the known result γₜ(G)γₜ(H) ≤ 6γₜ(G □ H) given by Henning and Rall.

A characterization of (γₜ,γ₂)-trees

You LuXinmin HouJun-Ming XuNing Li — 2010

Discussiones Mathematicae Graph Theory

Let γₜ(G) and γ₂(G) be the total domination number and the 2-domination number of a graph G, respectively. It has been shown that: γₜ(T) ≤ γ₂(T) for any tree T. In this paper, we provide a constructive characterization of those trees with equal total domination number and 2-domination number.

On the (2,2)-domination number of trees

You LuXinmin HouJun-Ming Xu — 2010

Discussiones Mathematicae Graph Theory

Let γ(G) and γ 2 , 2 ( G ) denote the domination number and (2,2)-domination number of a graph G, respectively. In this paper, for any nontrivial tree T, we show that ( 2 ( γ ( T ) + 1 ) ) / 3 γ 2 , 2 ( T ) 2 γ ( T ) . Moreover, we characterize all the trees achieving the equalities.

Page 1

Download Results (CSV)