dc.contributor.author N.I. Wulandari, I.H. Agustin, Dafik dc.date.accessioned 2016-02-02T06:41:54Z dc.date.available 2016-02-02T06:41:54Z dc.date.issued 2016-02-02 dc.identifier.uri http://repository.unej.ac.id/handle/123456789/73192 dc.description.abstract Let $G$ be a simple, connected and undirected en_US graph. Let $r,k$ be natural number. By a proper $k$-coloring of a graph $G$, we mean a map $c : V (G) \rightarrow S$, where $|S| = k$, such that any two adjacent vertices receive different colors. An $r$-dynamic $k$-coloring is a proper $k$-coloring $c$ of $G$ such that $|c(N (v))| \geq min\{r, d(v)\}$ for each vertex $v$ in $V (G)$, where $N (v)$ is the neighborhood of $v$ and $c(S) = \{c(v) : v \in S\}$ for a vertex subset $S$. The $r$-dynamic chromatic number, written as $\chi_r(G)$, is the minimum $k$ such that $G$ has an $r$-dynamic $k$-coloring. The $1$-dynamic chromatic number of graph is equal to its chromatic number, denoted by $\chi(G)$, and the $2$-dynamic chromatic number of graph has been studied under the name a dynamic chromatic number, denoted by $\chi_d(G)$. By simple observation it is easy to see that $\chi_r(G)\le \chi_{r+1}(G)$, for example $\chi(C_6)=2 but \chi_d(C_6)=3$. In this paper we will show the exact values of some graph operation of special graphs. dc.description.sponsorship CGANT UNEJ en_US dc.language.iso id en_US dc.subject r-dynamic coloring, r-dynamic chromatic number, graph operations en_US dc.title On r-Dynamic Coloring of Some Graph Operations en_US dc.type Working Paper en_US
﻿