Now showing items 1-4 of 4

    • On r-Dynamic Chromatic Number of the Corronation of Path and Several Graphs 

      KRISTIANA, Arika Indah; DAFIK, Dafik; UTOYO, Muhammad Imam; AGUSTIN, Ika Hesti (International Journal of Advanced Engineering Research and Science (IJAERS), [Vol-4, Issue-4, Apr- 2017], 2017-04-09)
      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 vert ...
    • On r-dynamic coloring of some graph operations 

      Agustin, Ika Hesti; Dafik, Dafik; A.Y. Harsya (2018-03-07)
      Let G be a simple, connected and undirected graph. Given r; k as any natural numbers. By an r-dynamic k-coloring of graph G, we mean a proper k-coloring c(v) of G such that jc(N(v))j minfr; d(v)g for each vertex v in ...
    • On the r-Dynamic Chromatic Number of the Corronation by Complete Graph 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; DAFIK, Dafik (IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018) 012033, 2018-04-27)
      In this paper we will study the r-dynamic chromatic number of the coronation by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v receive at least minfr; d(v)g di®erent colors. The ...
    • r-Dynamic Coloring of the Corona Product of Graphs 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; ALFARISI, Ridho; DAFIK, Dafik (Discrete Mathematics, Algorithms and Applications Vol. 12, No. 2 (2020) 2050019, 2020-01-21)
      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 ...