Antimagic Labeling of Complete Graphs and its Application in Chessboard
DOI:
https://doi.org/10.17762/msea.v71i4.574Abstract
The Purpose in this work is to extend antimagic labeling in complete graph Kn and defined special type of labeling such as Maximum Arithmetic Antimagic Labeling (MAAL), Minimum Arithmetic Antimagic Labeling (MIAAL), Maximum Product Antimagic Labeling (MPAL), Minimum Product Antimagic Labeling (MIPAL). In this research we will check whether while using these labelings on Knit satisfies or not (ie. Kn is MAAL or not and similarly to other 3 as we mentioned above). Also discussed some applications of antimagic labeling in Chessboard.