On local super antimagic face coloring of plane graphs

Let G(V, E) be a connected graph of order n and size m. A bijection g : V (G) boolean OR E(G) -> {1, 2,..., n m} is called a local super antimagic face coloring such that for any two adjacent face Al and A2, w(A(1)) not equal (A(2)) where w(A) = Sigma(v is an element of v(A)) f (v) + Sigma(e is an element of(A)) f (e). The local super antimagic face coloring chromatic number gamma 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 (J(n)), prism graph (P-n), double fan graph (Df(n)), and antiprism graph (Ap(n)).