Computing Antimagic Labeling of Lattically Designed Symmetric Networks

Abstract

In this article, we address the super edge-antimagic total labeling of the hexagonal lattice $HTT_{m,n}$ and two non-isomorphic forms of prismatic lattice $PTT_{m,n}$ . The aforementioned classes are symmetric lattices involving the finite chain of tripartite networks. Our article further closes with the summary, $3D$ - graphical illustrations and a practical example of our findings.

Keywords

• a, 0) edge-antimagic total labeling%22%2C%22default_operator%22%3A%22AND%22%7D%7D%7D"> Super (<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">a</italic>, 0) edge-antimagic total labeling
• Sₙ%22%2C%22default_operator%22%3A%22AND%22%7D%7D%7D"> star <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">Sₙ</italic>
• tripartite network
• lattice