The Dominator Edge Coloring of Graphs
Open Access
- 7 October 2021
- journal article
- research article
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2021, 1-7
Abstract
Let G be a simple graph. A dominator edge coloring (DE-coloring) of G is a proper edge coloring in which each edge of G is adjacent to every edge of some color class (possibly its own class). The dominator edge chromatic number (DEC-number) of G is the minimum number of color classes among all dominator edge colorings of G , denoted by χ d ′ G . 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 G and the operations of G .Keywords
Funding Information
- Science Found of Qinghai Province (2021-ZJ-703)
This publication has 10 references indexed in Scilit:
- Super cyclic antimagic covering for some families of graphsOpen Journal of Mathematical Sciences, 2021
- On the entire Zagreb indices of the line graph and line cut-vertex graph of the subdivision graphOpen Journal of Mathematical Sciences, 2020
- On dominated coloring of graphs and some Nordhaus–Gaddum-type relationsTURKISH JOURNAL OF MATHEMATICS, 2018
- Dominator Coloring of Generalized Petersen Graphs2017
- On dominator colorings in graphsProceedings - Mathematical Sciences, 2012
- Graph Theory2008
- EDGE DOMINATION IN GRAPHSTaiwanese Journal of Mathematics, 1998
- Line domination in graphsGraphs and Combinatorics, 1987
- Edge Dominating Sets in GraphsSIAM Journal on Applied Mathematics, 1980
- On domination and independent domination numbers of a graphDiscrete Mathematics, 1978