Cycle-Super Magic Labeling of Polyomino Linear and Zig-Zag Chains

Abstract

A bijective function with domain union of vertex and edge set to a range natural numbers to onward count of vertices and edges of a graph. If there is a bijective function G, then G is called as a H-magic graph, along with the condition that every subgraph H’ from the original graph G, H’ is isomorphic to H and with the interesting fact that sum of all the values of vertices and edges is constant for all H’. This condition can be more advance and strict when the first order-numbers assigned to the vertices only and then this definitions is called as H-super magic. In this paper, we study some polyomino structures, including zig-zag and linear chains. We studied, C8-super magic labeling of zig-zag, linear chains and also the disjoint union of non-isomorphic copies of both chains.