| dc.contributor.author | KRISTIANA, Arika Indah | |
| dc.contributor.author | DAFIK, Dafik | |
| dc.contributor.author | UTOYO, Muhammad Imam | |
| dc.contributor.author | AGUSTIN, Ika Hesti | |
| dc.date.accessioned | 2020-06-25T03:29:06Z | |
| dc.date.available | 2020-06-25T03:29:06Z | |
| dc.date.issued | 2017-04-09 | |
| dc.identifier.uri | http://repository.unej.ac.id/handle/123456789/99362 | |
| dc.description.abstract | This study is a natural extension of k -proper
coloring of any simple and connected graph G. By a n rdynamic
coloring of a graph G, we mean a proper k coloring
of
graph
G
such
that
the
neighbors
of
any
vertex
v
receive
at
least
min{r,
d(v)}
different
colors.
The
r-dynamic
chromatic
number,
written
as
r(G),
is
the
minimum
k
such
that
graph
G
has
an
r-dynamic
k
-coloring. In this paper we
will study the r-dynamic chromatic number of the
coronation of path and several graph. We denote the
corona product of G and H by 𝐺 ⨀ 𝐻. We will obtain the r-dynamic chromatic number of 𝜒𝑟
)and
𝜒𝑟
(𝑃𝑛 ⨀𝑃𝑚
), 𝜒𝑟
(𝑃𝑛 ⨀𝐶𝑚
(𝑃𝑛 ⨀𝑊𝑚
) for m, n 3. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | International Journal of Advanced Engineering Research and Science (IJAERS), [Vol-4, Issue-4, Apr- 2017] | en_US |
| dc.subject | r-dynamic chromatic number | en_US |
| dc.subject | path | en_US |
| dc.subject | corona product | en_US |
| dc.title | On r-Dynamic Chromatic Number of the Corronation of Path and Several Graphs | en_US |
| dc.type | Article | en_US |
| dc.identifier.kodeprodi | KODEPRODI0210101#Pendidikan Matematika | |
| dc.identifier.nidn | NIDN0002057606 | |
| dc.identifier.nidn | NIDN0001016827 | |
| dc.identifier.nidn | NIDN0001088401 | |
