Group H-Magic Labelings of Graphs. Dieser Artikel ist nicht verfügbar.Group H-Magic Labelings of Graphs

nach der Bestellung gedruckt Neuware - Printed after ordering - 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 trees. He believe that if a graph admits H-(super)magic labeling, then disjoint union of graph also admit an H-(super)magic labeling. Secondly, he described cycle-(super)magic labelings of uniform subdivided graph. Moreover, he studied cycle-supermagic labelings for non uniform subdivisions of some particular families of graphs namely fan graphs and triangular ladders. However, he believe that if a graph has a cycle-(super)magic labeling, then its non uniform subdivided graph also has a cycle-(super)magic labeling. Lastly, he proved that fan graphs and their disjoint union admit C3-group magic total labelings over a finite abelian group A.…