Local Antimagic Coloring of Some Graphs

Abstract: Given a graph $G =(V,E)$, a bijection $f: E \rightarrow {1, 2, \dots,|E|}$ is called a local antimagic labeling of $G$ if the vertex weight $w(u) = \sum_{uv \in E} f(uv)$ is distinct for all adjacent vertices. The vertex weights under the local antimagic labeling of $G$ induce a proper vertex coloring of a graph $G$. The \textit{local antimagic chromatic number} of $G$ denoted by $\chi_{la}(G)$ is the minimum number of weights taken over all such local antimagic labelings of $G$. In this paper, we investigate the local antimagic chromatic numbers of the union of some families of graphs, corona product of graphs, and necklace graph and we construct infinitely many graphs satisfying $\chi_{la}(G) = \chi(G)$.