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.
No takes yet. Share an insight, caveat, or question.
Latchoumanane et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: