Philippine E-Journals

Inverse Clique Domination in Graphs

Carmelita Loquias | Enrico Enriquez | Jonecis Dayap

 

Abstract:

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 setS ⊆ V (G) C is called an inverse clique dominating set with respect toC. The minimum cardinality of inverse clique dominating set is calledan inverse clique domination number of G and is denoted by γcl−1(G). An inverse clique dominating set of cardinality γcl−1(G) is called γcl−1-set of G. In this paper we investigate the concept and give some important results.

Mathematics Subject Classification: 05C69