Affiliation:
1. Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Vellore 632014, India
Abstract
A graph [Formula: see text] with [Formula: see text] vertices and [Formula: see text] edges has antimagic labeling if there is a bijection from the edge set of the graph to the label set [Formula: see text] such that [Formula: see text] vertices must have distinct vertex sums, where the vertex sums are determined by adding up all the edge labels incident to each vertex [Formula: see text] in [Formula: see text]. Hartsfield and Ringel conjectured that every connected graph is antimagic, except [Formula: see text]. In this study, we identified a class of connected graphs that lend credence to this conjecture. In this paper, we proved that the tensor product of a Wheel Graph, Helm Graph, and Flower graph with Star is antimagic.
Publisher
World Scientific Pub Co Pte Ltd
Reference12 articles.
1. Dense graphs are antimagic
2. Antimagic Labelings of Join Graphs
3. Lattice grids and prisms are antimagic
4. N. Hartsfield and G. Ringel , Pearls in Graph Theory (Academic Press, Inc., Boston, 1990), pp. 108–109; revised version, 1994.