Cyclic-antimagic construction of ladders
Muhammad Awais Umar · Engineering and Applied Science Letters · 2019
A simple graph G = (V, E) admits an H-covering if every edge in the edge set E(G) belongs to at least one subgraph of G isomorphic to a given graph H.|} defines a bijective map such that, for all subgraphs H of G isomorphic to H, the sums of labels of all vertices and edges belonging to H constitute an arithmetic progression with the initial term a and the common difference d.Such a graph is named as super (aIn the present paper, we study the existence of super (a, d)-cycle-antimagic labelings of ladder graphs for certain differences d.