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 \chi_{ed}(G). This article explores the concept of equitable dominator coloring for the line graph L(G) of some graph classes.
From: Phebe Sarah George [view email]
[v1]
Mon, 26 Aug 2024 16:04:25 UTC (13 KB)
[v2]
Thu, 23 Jul 2026 12:27:36 UTC (14 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。