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 .
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
