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 (G), is the smallest cardinality of a total restrained dominating set… (More)

R. Chérifi, S. Gravier, X. Lagraula, C. Payan, I. Zigham

Discrete Appl. Math. 94

1016

1 Excerpt

Similar Papers

Loading similar papers…

Cite this paper

@article{Chen2012OnTT,
title={On the total restrained domination number of direct products of graphs},
author={Hong-yu. Chen and Xue-Gang Chen and Wai Chee Shiu and Pak Kiu Sun},
journal={Discussiones Mathematicae Graph Theory},
year={2012},
volume={32},
pages={629-641}
}