FLOWER AS A MAGIC PLANE GRAPH
Let G be a plane graph. A labeling of some of its components (vertices, edges and bounded faces) will be called magic if the sum of the labels of items belonging to faces of the same size is equal. In this paper we will find, the minimum and maximum magic numbers for various types of (a, b, c) magic labelings of a graph that is called a flower.
magic graph, edge magic, plane graph, flower, minimal magic graph, maximal magic graph.
