Sign in
Back
Computing Antimagic Labeling of Lattically Designed Symmetric Networks
Journal article   Peer reviewed

Computing Antimagic Labeling of Lattically Designed Symmetric Networks

Hafiz Usman Afzal, Ahmed Alamer and Muhammad Javaid
IEEE access, Vol.10, pp.32394-32405
2022
DOI: https://doi.org/10.1109/ACCESS.2022.3160715

Abstract

0) edge-antimagic total labeling Labeling lattice Lattices Security 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ₙ 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 Terminology tripartite network Urban planning Wireless sensor networks
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.

Metrics

1 Record Views

Details