Antimagicness of subdivided fans
Afshan Tabassum, Muhammad Awais Umar, Muzamil Perveen, Abdul Raheem
Abstract
A graph (simple, finite, undirected) with an -covering has an (, )--antimagic labeling if the weights of all subgraphs of graph constitute an arithmetic progression with the common difference . Such a graph is called super (, )--antimagic if (V()) = {1, 2, 3, . . . , |V()|}. In the present paper, the cycle coverings of subdivision of fan graphs has been considered and results are proved for several differences.
Topics & Concepts
SubdivisionCombinatoricsGraphMathematicsUndirected graphButterfly graphDiscrete mathematicsLine graphVoltage graphArchaeologyHistoryGraph Labeling and Dimension Problems