On the total restrained domination number of direct products of graphs

Abstract

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)
DOI: 10.7151/dmgt.1632

Topics

3 Figures and Tables

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} }