Carmelita Loquias, Enrico Enriquez, Jonecis Dayap
Let G be a connected simple graph. A nonempty subset S of the vertex set V (G) is a clique in G if the graph hSi induced by S is complete. A clique S in G is a clique dominating set if it is a dominating set. Let C be a minimum clique dominating set in G. The clique dominating set S ⊆ V (G)\ C is called an inverse clique dominating set with respect to C. The minimum cardinality of inverse clique dominating set is calledan inverse clique domination number of G and is denoted by ycI-1(G). An inverse clique dominating set of cardinality ycI-1(G) is called Ycl-1-set of G. In this paper we investigate the concept and give some important results. © 2016, University of San Jose-Recoletos. All rights reserved.
University of San Carlos, Philippines; University of San Jose Recoletos, Philippines
