Local Antimagic Labeling of (P_? ° K₁) ° K₁

Let G = (V, E) be a graph with order n =|V| and size m =|E|. A bijection f: E → {1,2, . . ., m} is called a local antimagic labeling if for any adjacent vertices u and v, w(u) ≠ w(v) with w(u) = ?_uv?E(u) f(uv), where E(u) is the set of edges incident to u. A graph G is called local antimagic graph if it has local antimagic labeling. The local antimagic chromatic number of G is the minimum number of colors taken over all colorings induced by local antimagic labelings of G. The corona product of two graphs G and H is the graph G ∘ H obtained by taking one copy of G and n copies of H and joining the i^th vertex of G to every vertex in the i^th copy of H. In this study, we determine the local antimagic chromatic number for (P_? K₁) ∘ K₁ where Pₙ is a path of order n for n is even and n ≥ 4.