Abstract
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 is called a local edge antimagic labeling if for any two adjacent edges e1 and e2, , where for . 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 and determine exact value local edge antimagic coloring of .
Highlights
All graphs in this paper are finite, simple and connected graph, for detail definition of graph see [1, 2]
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
Published under licence by IOP Publishing Ltd number γlea(G) is the minimum number of colors taken over all colorings induced by local edge antimagic labelings of G
Summary
All graphs in this paper are finite, simple and connected graph, for detail definition of graph see [1, 2]. 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. Published under licence by IOP Publishing Ltd number γlea(G) is the minimum number of colors taken over all colorings induced by local edge antimagic labelings of G.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have