| dc.description.abstract | In this paper, we consider that all graphs are ¯nite, simple and connected.
Let G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡!
f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling if for any two adjacent edges
e
1
and e
2
, w(e
1
) 6 = w(e
), where for e = uv 2 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). It is considered to be a super local edge antimagic total coloring, if
the smallest labels appear in the vertices. The super local edge antimagic chromatic
number, denoted by °
2
(G), is the minimum number of colors taken over all colorings
induced by super local edge antimagic total labelings of G. In this paper we initiate
to study the existence of super local edge antimagic total coloring of comb product of
graphs. We also analyse the lower bound of its local edge antimagic chromatic number.
It is proved that °
leat
leat
(P
n
. G) ¸ °
leat
(P
n
) +°
(G). | en_US |
