| dc.contributor.author | KRISTIANA, Arika Indah | |
| dc.contributor.author | UTOYO, Muhammad Imam | |
| dc.contributor.author | DAFIK, Dafik | |
| dc.date.accessioned | 2020-06-25T05:05:08Z | |
| dc.date.available | 2020-06-25T05:05:08Z | |
| dc.date.issued | 2018-09-21 | |
| dc.identifier.uri | http://repository.unej.ac.id/handle/123456789/99378 | |
| dc.description | International Conference on Science and Applied Science (ICSAS) 2018 | en_US |
| dc.description.abstract | The dynamic coloring of a graph G is proper coloring such that every vertex of G with degree has at least two
neighbors that are colored differently. A generalization of the dynamic coloring was also introduced by Montgomery in
[12], the generalized concept is called r-dynamic k-coloring. An r-dynamic coloring of a graph G is a proper coloring c of
the vertices such that |𝑐(𝑁(𝑣)| ≥ min{𝑟, 𝑑(𝑣)}, for each v V(G). The r-dynamic chromatic number of a graph G,
denoted r(G) is the smallest k such that c is an r-dynamic k coloring of G. We will find the lower bound of the rdynamic
chromatic
number
of
graphs
corona
wheel
graph
and
some
new
results
the
exact
value
of
r-dynamic
chromatic
number
of
corona graphs. In this paper, we study the lower bound of 𝜒𝑟
(𝐻⨀𝑊𝑚
), 𝜒𝑟(𝑊𝑛⨀𝐻) and we also prove the
exact value of r-dynamic chromatic number of some graphs. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | AIP Conf. Proc. 2014, 020054-1–020054-7 | en_US |
| dc.subject | r-dynamic chromatic number | en_US |
| dc.subject | corona product | en_US |
| dc.subject | wheel graphs | en_US |
| dc.title | The Lower Bound of the r-Dynamic Chromatic Number of Corona Product by Wheel Graphs | en_US |
| dc.type | Article | en_US |
| dc.identifier.nidn | KODEPRODI0210101#Pendidikan Matematika | |
| dc.identifier.nidn | NIDN0002057606 | |
| dc.identifier.nidn | NIDN0001016827 | |
