Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Trees with equal total domination and total restrained domination numbers

Xue-Gang Chen;  Wai Chee Shiu;  Hong-Yu Chen — 2008

Discussiones Mathematicae Graph Theory

For a graph G = (V,E), a set S ⊆ V(G) is a total dominating set if it is dominating and both ⟨S⟩ has no isolated vertices. The cardinality of a minimum total dominating set in G is the total domination number. A set S ⊆ V(G) is a total restrained dominating set if it is total dominating and ⟨V(G)-S⟩ has no isolated vertices. The cardinality of a minimum total restrained dominating set in G is the total restrained domination number. We characterize all trees for which total domination and total restrained...

On the total restrained domination number of direct products of graphs

Wai Chee Shiu;  Hong-Yu Chen;  Xue-Gang Chen;  Pak Kiu Sun — 2012

Discussiones Mathematicae Graph Theory

Let G = (V,E) be a graph. A total restrained dominating set is a set S ⊆ V where every vertex in V∖S is adjacent to a vertex in S as well as to another vertex in V∖S, and every vertex in S is adjacent to another vertex in S. The total restrained domination number of G, denoted by γ r t ( G ) , is the smallest cardinality of a total restrained dominating set of G. We determine lower and upper bounds on the total restrained domination number of the direct product of two graphs. Also, we show that these bounds...

Page 1

Download Results (CSV)