Department of Mathematics
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 γrt(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 are sharp by presenting some infinite families of graphs that attain these bounds.
total domination number, total restrained domination number, direct product of graphs
Source Publication Title
Discussiones Mathematicae Graph Theory
De Gruyter Open
Link to Publisher's Edition
Shiu, Wai Chee, Hong-Yu Chen, Xue-Gang Chen, and Pak Kiu Sun. "On the total restrained domination number of direct products of graphs." Discussiones Mathematicae Graph Theory 32.4 (2012): 629-641.