Local Antimagic Chromatic Number for the Corona Product of Friendship graph

Let  be a graph of order  and size  having no isolated vertices. A bijection  is called a local antimagic labeling if for all  we have , the weight , where  is the set of edges incident to . A graph  is local antimagic if  has a local antimagic labeling. The local antimagic chromatic number  is defined to be the minimum number of colors taken over all colorings of  induced by local antimagic labelings of  [1-2]. The corona product of two graphs  and  is the graph obtained by taking one copy of  along with  copies of , and putting extra edges making the  vertex of  adjacent to every vertex of the  copy of , where  [3]. In this paper, we investigate the local antimagic chromatic number for the corona product of friendship graph.