Local Antimagic Chromatic Number of Super Star Graph

Let G(V, E) be a graph with the vertex set V and edge set E. The local antimagic labeling of G with |E| edges is defined as a bijective function f: E → {1,2, …, |E|} such that w u) ≠ w(v) for any adjacent vertices uv ∈ E, where w(u) = S_e?E(u)f(e) and E(u) is the set of edges incident to u. A local antimagic chromatic number of G is the minimum number of colors induced by the local antimagic labeling of G. A super star graph is a graph obtained by identifying a leaf from n star of order m for n and m are integer. In this article, we determine the local antimagic chromatic number of the super star graph.