Abstract
An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(W(v))| > min (r,d(v)}, for each v V(G). The r-dynamic chromatic number of a graph G is the minimum k such that G has an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of middle, total, central and line graph of Tadpole graph as well as their lower bound.
Original language | English |
---|---|
Pages (from-to) | 109-122 |
Number of pages | 14 |
Journal | Ars Combinatoria |
Volume | 148 |
Publication status | Published - Jan 2020 |
Keywords
- Central graph and line graph
- Middle graph
- R-dynamic coloring
- Tadpole graph
- Total graph