• Dr.A.Vijayalekshmi
• S.Abisha

Let G be a finite, undirected and connected graph with minimum degree at least one. A proper coloring C of G is said to be a total dominator color class total dominating set of G if each vertex properly dominates a color class in C and each color class in C is properly dominated by a vertex in V(G). A total dominator color class total dominating set D of G is a minimal total dominator color class total dominating set if no proper subset of D is a total dominator color class total dominating set of G. The total dominator color class total domination number is the minimum cardinality taken over all minimal total dominator color class total dominating sets in G and is denoted by〖 γ〗_(χ )^td (G). Here we obtain〖 γ〗_(χ )^td (G) for open ladder graph and Tadpole graph.

Chromatic number, Domination number, Total domination, Dominator color class dominating set, Total dominator color class total domination number

"Total Dominator Color Class Total Dominating Sets in Open Ladder Graph and Tadpole Graph", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.12, Issue 5, page no.a538-a544, May-2025, Available :http://www.jetir.org/papers/JETIR2505059.pdf

"Total Dominator Color Class Total Dominating Sets in Open Ladder Graph and Tadpole Graph", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.12, Issue 5, page no. ppa538-a544, May-2025, Available at : http://www.jetir.org/papers/JETIR2505059.pdf