The Dominator Edge Coloring of Graphs

Minhui Li, Shumin Zhang, Caiyun Wang and Chengfu Ye

Mathematical Problems in Engineering, 2021, vol. 2021, 1-7

Abstract:

Let be a simple graph. A dominator edge coloring (DE-coloring) of is a proper edge coloring in which each edge of is adjacent to every edge of some color class (possibly its own class). The dominator edge chromatic number (DEC-number) of is the minimum number of color classes among all dominator edge colorings of , denoted by . In this paper, we establish the bounds of the DEC-number of a graph, present the DEC-number of special graphs, and study the relationship of the DEC-number between and the operations of .

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/8178992.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/8178992.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:8178992

DOI: 10.1155/2021/8178992

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().