Abstract
Let G(V, E) be a connected graph of order n and size m. A bijection g: V(G) ∪ E(G) → {1,2, ..., n + m} is called a local super antimagic face coloring such that for any two adjacent face A1 and A2, w(A1) ≠ w(A2) where w(A) = ∑v∈ V(A)f(v) + ∑e∈ E(A)f(e). The local super antimagic face coloring chromatic number γlaf(G) defined the minimum number of colors taken over all colorings of G induced by local super antimagic face coloring of G. In this paper, we study local super antimagic face coloring of some plane graphs. The name of graphs are gear graph (Jn), prism graph (Pn), double fan graph (Dfn), and antiprism graph (Apn).
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.