A network communication through McGee graph and Antimagic labeling

Abstract

Let $G$ be a simple graph with $p$ nodes and $q$ links. A one to one correspondence between the set of links and the set of integers $\{1,2, \ldots, q\}$ is called the Antimagic labeling if the sum of the link labels incident with a node is different for all nodes. If the Antimagic labeling is assignable on a graph, it is termed as an Antimagic graph. In this paper, on the McGee graph, the Antimagic, the Even Antimagic and the Odd Antimagic graphs can be allotted is proved. Through the McGee graph and Antimagic labeling, an application for Network Communication is presented.