A note on local edge antimagic chromatic number of graphs

Let G be a finite, undirected and simple graph. A bijection f: V (G) 1, |V (G) | is called a local edge antimagic labeling if for any two adjacent edges uv, vw E (G), f (u) f (w). The local edge antimagic chromatic number (G) is the minimum number of colors taken over all colorings induced by local edge antimagic labeling of G. In this paper, we investigate characterization of graphs G with small number (G), relationship between local edge antimagic chromatic number (G) and edge independence number ' (G), and bounds of (G) for any graphs.