Vertex Covering Transversal Domination in Graphs
R. Vasanthi, K. Subramanian · International Journal of Mathematics and Soft Computing · 2015
Abstract A set  of vertices in a graph G = (V, E) is called a dominating set if every vertex in V – D is adjacent to a vertex in D. A set C V of vertices in G is called a vertex covering set if every edge of G is incident to at least one vertex in C. Also C is said to be a minimum vertex covering set if there is no other vertex covering set C’ such that. A dominating set which intersects every minimum vertex covering set in G is called a Vertex Covering Transversal Dominating set. The minimum cardinality of a vertex covering transversal dominating set is called Vertex Covering Transversal Domination number of G and is denoted by . In this paper, we begin with an investigation of this parameter.  Keywords: dominating set, vertex covering set, vertex covering transversal dominating set Â