Equitable Dominator Coloring of Line Graphs of Some Graphs
Phebe Sarah George, Sudev Naduvath

TL;DR
This paper investigates equitable dominator colorings, focusing on the line graphs of certain graph classes, and introduces the concept of equitable dominator chromatic number as a new coloring parameter.
Contribution
It extends the concept of equitable dominator coloring to line graphs and explores its properties for specific graph classes, introducing new theoretical insights.
Findings
Defined equitable dominator chromatic number for line graphs
Analyzed properties for specific graph classes
Established bounds and characteristics of EDCN
Abstract
A proper vertex coloring of the graph such that each vertex dominates at least one color class and the cardinalities of the color classes differ by at most is called an equitable dominator coloring of . The minimum number of colors used in this coloring is called the equitable dominator chromatic number (EDCN), represented by . This article explores the concept of equitable dominator coloring for the line graph of some graph classes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research
