An equitable dominator coloring of a graph [Formula: see text] is a proper vertex coloring of [Formula: see text] such that every vertex dominates at least one color class and the cardinalities of any two color classes differ by at most 1. The minimum number of colors used in the equitable dominator coloring of [Formula: see text] is called its equitable dominator chromatic number, denoted by [Formula: see text]. This paper discusses the equitable dominator coloring of various helm-related graphs by obtaining their equitable dominator chromatic numbers.
Discussion(0)
No comments yet. Be the first to comment.