… Roushini Leely Pushpam and K. Priya Bhanthavi, Independent transversal domination …
Priya Bhanthavi, The stability of independent transversal domination in trees, Discrete Math. …

A set S ⊆ V of vertices in a graph G = ( V , E ) is called a dominating set if every vertex in V −
S is adjacent to a vertex in S . An independent transversal dominating set in a graph G is a …

… Let P = (v1,v2,...,vk−1,vk) be a diametral path in T where k = diam(T) + 1. Without loss of …
[7] PRL Pushpam and KP Bhanthavi, The stability of independent transversal domination in …

A set S ⊆ V of vertices in a graph G = ( V , E ) is called a dominating set if every vertex in V −
S is adjacent to a vertex in SI Sahul Hamid [I. Sahul Hamid, Independent Transversal …

A partition of V (G) into dominating sets is called a domatic partition of G. The maximal number
of classes of a domatic partition of G is called the domatic number of G and denoted by d (…

… Researcher: Priya Bhanthavi K …