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

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

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

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

Let ( )EVG , be a simple and connected graph of vertex set V and edge set E. By the 2-distance chromatic number of a graph G, we mean a map ( ) { }k c GV ,1 ,2 ,3 ..., : → such that any two vertices ...

The aim of this study is to know the result of Discovery Based Learning Implementation through Improving Students’ innovative thinking skills in solving open-ended task of pattern generalization. The method used in the ...

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 : ( ) l V G {1, 2, , } k →  is called vertex irregular k-labelling ...

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 is connected 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 vertex of color i are ...

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