Local Edge Antimagic Coloring of Comb Product of Graphs
Ika Hesti Agustin, Moh. Hasan, Dafik Dafik, Ridho Alfarisi, Arika Indah Kristiana, Rafiantika Megahnia Prihandini · Journal of Physics Conference Series · 2018
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 e 1 and e 2 , , 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 .