Abstract
A Super antimagic total labeling of a graph with vertices and edges is a bijective function λ from the set onto the set , such that the total —weights, , form an arithmetic sequence with the smallest label appears on the vertex. This paper discusses about super antimagic total labeling of disjoint union of graph .
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.