The stability of independent transversal domination in trees
P. Roushini Leely Pushpam, K. Priya Bhanthavi · Discrete Mathematics Algorithms and Applications · 2020
A set [Formula: see text] of vertices in a graph [Formula: see text] is called a dominating set if every vertex in [Formula: see text] is adjacent to a vertex in [Formula: see text]. An independent transversal dominating set in a graph [Formula: see text] is a dominating set which intersects every maximum independent set of [Formula: see text]. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of [Formula: see text] denoted by [Formula: see text]. In this paper, we characterize those trees whose independent transversal domination number does not alter owing to the deletion of a vertex.