Results on Restrained Certified Domination Number of Graphs

Abstract

In this article, we have defined the concept of restrained certified domination number of graphs. For any connected graph G, a restrained dominating set S is said to be a restrained certified dominating set if for every  there exists either at least two neighbors in  or no neighbors in . The minimum cardinality of the restrained certified dominating set is called the restrained certified domination number and is denoted by . A restrained certified dominating set of cardinality  is called a  set. Relation of   with other graph theoretical parameters have been discussed. Also this paper includes the characterization of graphs. Nordhas – Gaddum type results have been studied for some values of n.