On Equitable Dominator Coloring of Splitting Graphs from Specific Graph Classes

Authors

  • S. Seethaladevi Department of Mathematics, Vels Institute of Science, Technology & Advanced Studies, Chennai, Tamil Nadu, India.
  • G. Jayaraman Department of Mathematics, Vels Institute of Science, Technology & Advanced Studies, Chennai, Tamil Nadu, India.

DOI:

https://doi.org/10.70917/ijcisim-2026-2884

Keywords:

Dominator chromatic number, Dominator coloring, Splitting Graph, complete graph, Star graph, Ladder Rung Graph, Banana tree, Sun let graph, Comb Graph, Chromatic number

Abstract

An equitable dominator coloring (EDC) of a graph G is a proper coloring of G where each vertex dominates every other vertex of at least one color class and the cardinalities of the color classes differ by a maximum of one. The equitable dominator chromatic number of G, which is represented by , is the minimum number of colors desired for a dominator coloring of G. In this paper, we calculate the dominator chromatic number of splitting graphs of specific graph classes.

Downloads

Download data is not yet available.

Downloads

Published

2026-07-08

How to Cite

S. Seethaladevi, & G. Jayaraman. (2026). On Equitable Dominator Coloring of Splitting Graphs from Specific Graph Classes. International Journal of Computer Information Systems and Industrial Management Applications, 18(6s), 269–280. https://doi.org/10.70917/ijcisim-2026-2884

Issue

Vol. 18 No. 6s (2026)

Section

Original Articles