ON SIGNED MAGIC CORDIAL LABELING
In this paper, we have introduced a new type of labeling called signed magic cordial labeling. We have provided algorithms and written python programs (Ver. 3.8.2) to assign labels for vertices and edges of a graph in order to prove that the graph admits signed magic cordial labeling.
signed magic cordial labeling, trees, Petersen graph, web graphs, antiprism.
