Revised Scheme for Antimagic Graph Labeling for Splitting Graph and Shadow Graph Associated with Cycle

Antimagic graph labeling is the allotment of positive numbers to the edges of a graph such that the sum of graph edge labels incident to each node varies. The paper emphasizes on strong antimagic graph labeling for splitting graph and shadow graph of cycle. Modified theorems and their proofs on splitting and shadow graphs of cycle have been presented. The validity of the theorems has been illustrated through numerous examples.

A modified anti-magic graph labeling for middle graph and total graph related to path

Graph labeling is the assignment of integers to edges or vertices or both depending on some factors which is consequential in the field of graph theory. In this paper, anti-magic graph labeling of two graphs, middle graph and total graph of path graph have been mainly focused. Modified proofs of theorems on anti-magic graph labeling have been introduced here. Both of the theorems are applicable for strong anti-magic graph. The correctness of the proofs has been demonstrated through various examples.