All graphs in this paper is connected and simple. Let ( ) be a connected and simple graph with vertices set and edge set . A bijection function * | ( )|+ is called an edge antimagic vertex ...

All graph in this paper is connected and simple graph. Let du,v be a distance between any vertex u and v in graph G  V,E . A function c :VG1, 2,, k is called a packing k-coloring if every two vertices ...

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 graphs in this paper are nontrivial and connected graph. Let 𝑓 ∶ 𝑉 (𝐺) → *1,2, … , 𝑘+ be a vertex coloring of a graph 𝐺where two adjacent vertices may be colored the same color. Consider the color classes Π = ...

Let G = (V; E) be a connected graph. A bijection function f : E(G) ! f1; 2; 3; ; E(G)jg is called a local antimagic labeling if for all uv 2 E(G)s, w(u) 6= w(v), where w(u) = e2E(u)f(e). Such that, local antimagic ...

A function f is called a local irregularity vertex coloring if (i) l : V (G) ! f1; 2; ; kg as vertex irregular k-labeling and w : V (G) ! N, for every uv 2 E(G); w(u) 6= w(v) where w(u) = v2N(u)l(v) and (ii) ...

In this paper, we study vertex coloring edge of corona graph. A k-edge weigting of graph G is mapping w : (EG) ! f1; 2; ; kg. An edge-weighting w induces a vertex coloring Fw : V (G) ! N de ned by fw(v) = P v2e w(e). ...

For a set W = { s1,s2,...,sk of vertices of a graph G, the representation multiset of a vertexv of G with respect to W is r(v | W ) = { d(v, s1),d(v, s2),...,d(v, sk) } , where d(v, si) is a distance between of ...