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 ...

All graph in this paper is connected and simple graph. Let graph d(u,v) be a distance between any vertex u and v in graph ( ). A functio ( ) * +n is called vertex irregular k-labelling and ( ) where ...

All graph in this paper are connected and simple. Let G = (V, E) be a simple graph, where V (G) is vertex set and E(G) is edge set. The local irregularity vertex coloring of G is l : V (G) → {1, 2, · · · , k} and w : V (G) ...