Saduakdee S.; Khemmani V.
(American Institute of Mathematical Sciences, 2023)
Let G be a graph of order n and size m. A vertex magic total labeling of G is a one-to-one function f: V(G)∪E(G) → {1, 2, · · ·, n+m} with the property that for each vertex u of G, the sum of the label of u and the labels ...