TY - JOUR

T1 - R-Dynamic coloring of the corona product of graphs

AU - Kristiana, Arika Indah

AU - Utoyo, M. Imam

AU - Alfarisi, Ridho

AU - Dafik,

N1 - Publisher Copyright:
© 2020 World Scientific Publishing Company.

PY - 2020/4/1

Y1 - 2020/4/1

N2 - Let G = (V,E) be a graph. A proper k-coloring of graph G is r-dynamic coloring if for every v, the neighbors of vertex v receive at least min{r,d(v)} different colors. The minimum k such that graph G has r-dynamic k coloring is called the r-dynamic chromatic number, denoted by χr(G). In this paper, we study the r-dynamic coloring of corona product of graph. The corona product of graph is obtained by taking a number of vertices |V (G)| copy of H, and making the ith of V (G) adjacent to every vertex of the ith copy of V (H). We obtain the lower bound of r-dynamic chromatic number of corona product of graphs and some exact value.

AB - Let G = (V,E) be a graph. A proper k-coloring of graph G is r-dynamic coloring if for every v, the neighbors of vertex v receive at least min{r,d(v)} different colors. The minimum k such that graph G has r-dynamic k coloring is called the r-dynamic chromatic number, denoted by χr(G). In this paper, we study the r-dynamic coloring of corona product of graph. The corona product of graph is obtained by taking a number of vertices |V (G)| copy of H, and making the ith of V (G) adjacent to every vertex of the ith copy of V (H). We obtain the lower bound of r-dynamic chromatic number of corona product of graphs and some exact value.

KW - corona product of graph

KW - r-Dynamic chromatic number

UR - http://www.scopus.com/inward/record.url?scp=85078159437&partnerID=8YFLogxK

U2 - 10.1142/S1793830920500196

DO - 10.1142/S1793830920500196

M3 - Article

AN - SCOPUS:85078159437

SN - 1793-8309

VL - 12

JO - Discrete Mathematics, Algorithms and Applications

JF - Discrete Mathematics, Algorithms and Applications

IS - 2

M1 - 2050019

ER -