Clique transversal sets

Let G = (V, E) be a simple graph. A clique of G is a maximal complete subgraph of G. A subset D of V which meets every clique of G is called a clique transversal set of G. Since V(G) is a clique transversal set of G, the existence of a clique transversal set of G is guaranteed in any graph. The minimum cardinality of a clique transversal set of G is called the clique transversal number of G and is denoted by rclt(G). A study on this concept is initiated in this paper.