• A. Esakkimuthu
• S. Mari Selvam

Let G = (V_p, E_q) be a connected graph. Assume a group CC containing colors. Let τ: V_p(G) → CC be an equitably colorable function. A dominating subset S_P of V_p is called an equitable color class dominating set if the number of dominating nodes in each color class is equal. The least possible cardinality of an equitable color class dominating set of G is equitable color class domination number itself. It is indicated by γ_ECC (G). In this paper we explore the equitable color class domination number of some special graphs and some derived path graphs.

Domination, Dominating Set, Equitable Coloring, Color Class(CC), Equitable Color Class, Equitable Color Class Dominating set.

"EQUITABLE COLOR CLASS DOMINATION NUMBER OF SOME SPECIAL GRAPHS AND SOME DERIVED PATH GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.9, Issue 12, page no.e199 - e204, December-2022, Available :http://www.jetir.org/papers/JETIR2212426.pdf

"EQUITABLE COLOR CLASS DOMINATION NUMBER OF SOME SPECIAL GRAPHS AND SOME DERIVED PATH GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.9, Issue 12, page no. ppe199 - e204, December-2022, Available at : http://www.jetir.org/papers/JETIR2212426.pdf