All graph in this paper are finite, simple and connected graph. Let G(V, E) be a graph of vertex set V and edge set E. A bijection f: V(G) → {1,2,3,...,|V(G)|} is called a local edge antimagic labeling if for any two adjacent edges e_1 and e_2, w(e_1) ≠ w(e_2), where for e = uv ∈ G, w(e) = f(u)+f(v). Thus, any local edge antimagic labeling induces a proper edge coloring of G if each edge e is assigned the color w(e). The local edge antimagic hromatic number γ_(lea) (G) is the minimum number of colors taken over all colorings induced by local edge antimagic labelings of G. In this paper, we have found the lower bound of the local edge antimagic coloring of G > H and determine exact value local edge antimagic coloring of G > H.
展开▼
