on local antimagic chromatic number of various join graphs

A local antimagic edge labeling of a graph g = (v, e) is a bijection f : e → {1, 2, . . . , |e|} such that the induced vertex labeling f + : v → z given by f +(u) = ∑f(e), where the summation runs over all edges e incident to u, has the property that any two adjacent vertices have distinct labels. a graph g is said to be locally antimagic if it admits a local antimagic edge labeling. the local antimagic chromatic number χla(g) is the minimum number of distinct induced vertex labels over all local antimagic labelings of g. in this paper we obtain sufficient conditions under which χla(g ∨ h), where h is either a cycle or the empty graph on = kn, satisfies a sharp upper bound. using this we determine the value of χla(g ∨ h) for many wheel related graphs g.