Computing Antimagic Labeling of Lattically Designed Symmetric Networks

On the antimagicness of generalized edge corona graphs

“… Graphs Ref. - Paths - Cycles - Wheels - Complete graphs [8] - Graphs with △( G )≥ n − 3 [17] - Toroidal grids - Higher dimensional toroidal grids - Cartesian product of cycle and k -regular graph [15] - Sequential generalized corona graphs - Generalized snowflake graphs [5] - n -barbell graph n ≥ 3 - Edge corona of bistar graph and k -regular graph - Edge corona of cycles [12] - Binomial trees - Fibonacci trees [14] Complete m -ary trees [3] Subclasses of trees [10] Caterpillars [11] Regular graphs [2] , [4] Biregular bipartite graphs [16] Hexagonal lattice Prismatic lattice [1] …”

Antimagic Labeling for Some Snake Graphs

“…In [2], Afzal et al show that antimagic labeling is useful for saving data from hackers attacks, channel assignment problem as well as routing problem.…”

On Cubic Roots Cordial Labeling for Some Graphs

“…In [11], they obtained an S − (a, 0) − EAMT and S − (a , 2) − EAMT labeling of symmetric classes of networks termed as hexagonal lattice HTT m,n and prismatic lattice T m,n . For more details about the cordial labeling, the reader can refer to [12][13][14][15].…”