Group H-Magic Labelings of Graphs

This book firstly studied that, if a graph G has a H-supermagic labeling then either disjoint union of isomorphic and non isomorphic copies of G will have a H-supermagic labeling or not? The author has studied this problem for the cycle-supermagic labelings of disjoint union of isomorphic and non isomorphic copies of some particular families of graphs namely fan graphs, wheels, ladder graphs and prism graphs etc. The author also formulated the K2-supermagic labelings of some families of alpha t ...