Now showing items 1-2 of 2

    • 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 ...
    • The r-Dynamic Local Irregularity Vertex Coloring of Graph 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; DAFIK, Dafik; ALFARISI, Ridho; WALUYO, Eko (INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 07, JULY 2019, 2019-07-01)
      We define the r-dynamic local irregularity vertex coloring. Suppose  : V(G)  {1,2, … , k} is called vertex irregular k-labeling and w : V(G)  N where 𝑤(𝑢) = ∑ (𝑣) .  is called r-dynamic local irregular vertex ...