Equitable Dominator Coloring of Line Graphs of Some Graphs

2024/08/26 by Phebe Sarah George, Sudev Naduvath, George, Phebe Sarah +1
Mathematics · #math.CO

paper · pdf · doi:10.48550/arxiv.2408.14382

Abstract

A proper vertex coloring of the graph G such that each vertex dominates at least one color class and the cardinalities of the color classes differ by at most 1 is called an equitable dominator coloring of G. The minimum number of colors used in this coloring is called the equitable dominator chromatic number (EDCN), represented by χ_ed(G). This article explores the concept of equitable dominator coloring for the line graph L(G) of some graph classes.

Related

• Equitable Dominator Coloring of Graphs
• Dominated and dominator colorings over (edge) corona and hierarchical products
• Total dominator chromatic number of some operations on a graph
• Total dominator chromatic number of specific graphs
• Majority dominator colorings of graphs