Let <em>G</em>=(<em>V</em>,<em>E</em>) be connected graph. A bijection <em>f </em>: <em>E</em> → {1,2,3,..., |<em>E</em>|} is a local antimagic of <em>G</em> if any adjacent vertices <em>u,v</em> ∈ <em>V</em> satisfies <em>w</em>(<em>u</em>)≠ <em>w</em>(<em>v</em>), where <em>w</em>(<em>u</em>)=∑<sub>e∈E(u) </sub><em>f</em>(<em>e</em>), <em>E</em>(<em>u</em>) is the set of edges incident to <em>u</em>. When vertex <em>u</em> is assigned the color <em>w</em>(<em>u</em>), we called it a local antimagic vertex coloring of <em>G</em>. A local antimagic chromatic number of <em>G</em>, denoted by <em>χ</em><sub>la</sub>(<em>G</em>), is the minimum number of colors taken over all colorings induced by the local antimagic labeling of <em>G</em>. In this paper, we determine the local antimagic chromatic number of corona product of friendship and fan with null graph on <em>m</em> vertices, namely, <em>χ</em><sub>la</sub>(<em>F</em><sub>n</sub> ⊙ \overline{K_m}) and <em>χ</em><sub>la</sub>(<em>f</em><sub>(1,n)</sub> ⊙ \overline{K_m}).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.