*Department of Mathematics, College of Education for Pure Sciences, University of Baghdad, Ibn AL Haitham, Iraq
**Department of Mathematics, Anna University, Chennai, India
Let G = (V, E, F) be a simple, finite, connected plane graph with V(G) as a vertex set, E(G) an edge set and F(G) set of faces, a labeling of type (1, 1, 0) is a bijection from the vertex set and edge set of a graph G to the set {1, 2, …, |V(G)|+|E(G)|}. This labeling is called super if the set of vertices received the smallest number. The weight of a face w(f) under this labeling is sum of labels of the vertices and edges surrounding this face.
In this paper we introduce and study face bimagic labeling of type (1, 1, 0) on new families of plane graphs called strong face graphs.
Face bimagic, strong face graphs
