Total restrained domination in graphs with minimum degree two

@article{Henning2008TotalRD,
title={Total restrained domination in graphs with minimum degree two},
author={Michael A. Henning and Jacob Elgin Maritz},
journal={Discrete Mathematics},
year={2008},
volume={308},
pages={1909-1920}
}

In this paper, we continue the study of total restrained domination in graphs, a concept introduced by Telle and Proskurowksi (Algorithms for vertex partitioning problems on partial k-trees, SIAM J. Discrete Math. 10 (1997) 529–550) as a vertex partitioning problem. A set S of vertices in a graph G = (V , E) is a total restrained dominating set of G if every vertex is adjacent to a vertex in S and every vertex of V \S is adjacent to a vertex in V \S. The minimum cardinality of a total… CONTINUE READING