On r-Dynamic Coloring of the Family of Tadpole Graphs

A. I. Kristiana, G. Nandini, M. Venkatachalam, M. I. Utoyo, S. Gowri

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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 languageEnglish
Pages (from-to)109-122
Number of pages14
JournalArs Combinatoria
Publication statusPublished - Jan 2020


  • Central graph and line graph
  • Middle graph
  • R-dynamic coloring
  • Tadpole graph
  • Total graph


Dive into the research topics of 'On r-Dynamic Coloring of the Family of Tadpole Graphs'. Together they form a unique fingerprint.

Cite this