Extended Results on Restrained Domination Number and Connectivity of a Graph
C. Sivagnanam, M. P. Kulandaivel · International Journal of Mathematics and Soft Computing · 2015
A subset S of V is called a dominating set in G if every vertex in V − S is adjacent to at least one vertex in S. A dominating set S is said to be a restrained dominating set if 〈V − S 〉 contains no isolated vertices. The minimum cardinality of a restrained dominating set of G is called the restrained domination number of G and is denoted by γr(G). The connectivity κ(G) of a graph G is the minimum number of vertices whose removal results in a disconnected or trivial graph. In this paper we characterized the graphs with sum of restrained domination number and connectivity is equal to 2n − 6.