Let G=(V,E) be a graph. A set S?V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S. The restrained domination number of G, denoted by γr(G), is the smallest cardinality of a restrained dominating set of G. In this paper we will bound the size of a graph G, given the restrained domination number of G.
展开▼
