INDUCED V4–MAGIC LABELING OF MIDDLE GRAPHS
Let be the Klein-4-group and be a graph. Let be a vertex labeling and denote the induced edge labeling of f defined by for all Then again induces a vertex labeling defined by where the summation is taken over all the vertices v which are adjacent to u. A graph G is said to be an induced V4-magic graph if there exists a nonzero vertex labeling such that The function f, so obtained is called an induced V4-magic labeling of G. In this paper, we discuss induced magic labeling of the middle graph of some graphs.
Klein-4-group, induced V4-magic graphs, middle graph of a graph.