Local antimagic r-dynamic coloring of graphs

A. I. Kristiana, M. I. Utoyo, Dafik, I. H. Agustin, R. Alfarisi

Research output: Contribution to journalConference articlepeer-review


Let G = (V, E) be a connected graph. A bijection function f : E(G) → {1,2, 3, • • •, E(G)|} is called a local antimagic labeling if for all uv ∈ E(G)s, w(u) ≠ w(v), where w(u) = ∑e∈E(u) f(e). Such that, local antimagic labeling induces a proper vertex k-coloring of graph G that the neighbors of any vertex u receive at least min{r, d(v)} different colors. The local antimagic r-dynamic chromatic number, denoted by (G) is the minimum k such that graph G has the local antimagic r-dynamic vertex k-coloring. In this paper, we will present the basic results namely the upper bound of the local antimagic r-dynamic chromatic number of some classes graph.

Original languageEnglish
Article number012077
JournalIOP Conference Series: Earth and Environmental Science
Issue number1
Publication statusPublished - 9 Apr 2019
Event1st International Conference on Environmental Geography and Geography Education, ICEGE 2018 - Jember, East Java, Indonesia
Duration: 17 Nov 201818 Nov 2018


Dive into the research topics of 'Local antimagic r-dynamic coloring of graphs'. Together they form a unique fingerprint.

Cite this