Transversal domination in graphs
Anwar Alwardi, S. R. Nayaka, Puttaswamy · Gulf Journal of Mathematics · 2018
Let G = (V, E) be a graph. A dominating set S of G which intersects every minimum dominating set in G is called a transversal dominating set. The minimum cardinality of a transversal dominating set is called the transversal domination number, denoted by γtd(G). In this paper, we begin to study this parameter. We calculate γtd(G) for some families of graphs. Further some bounds and relations with other domination parameters are obtained for γtd(G).