Equitable Dominator Coloring of Line Graphs of Some Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917759202361344 |
|---|---|
| author | George, Phebe Sarah Naduvath, Sudev |
| author_facet | George, Phebe Sarah Naduvath, Sudev |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_14382 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Equitable Dominator Coloring of Line Graphs of Some Graphs George, Phebe Sarah Naduvath, Sudev Combinatorics {05C15, 05C69, 05C76} 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. |
| title | Equitable Dominator Coloring of Line Graphs of Some Graphs |
| topic | Combinatorics {05C15, 05C69, 05C76} |
| url | https://arxiv.org/abs/2408.14382 |