EQUITABLE DOMINATING CHROMATIC SETS IN GRAPHS
L. Muthusubramanian, S.P. Subbiah, V. Swaminathan · International Journal of Pure and Apllied Mathematics · 2015
is an equitable dominating chromatic set of G, the existence of equitable dominating chromatic set in a graph is guaranteed.The minimum cardinality of such a set is called the equitable dominating chromatic number of G and is denoted by γ e ch (G).The property of equitable dominating chromatic set is super hereditary.Hence equitable dominating chromatic set is minimal if and only if it is 1minimal.Characterization of minimal equitable dominating chromatic sets is derived.The values of γ e ch (G) for many classes of graphs have been found.It is established that 1 ≤ γ e ch (G) ≤ n.Interesting results are proved with respect to the new parameters.