Antimagic Labeling of Complete Graphs and its Application in Chessboard

Abstract

The Purpose in this work  is  to  extend  antimagic  labeling  in complete graph K_n 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. K_n is MAAL or not and similarly to  other 3 as we mentioned above). Also discussed some applications of antimagic labeling in Chessboard.