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 .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
