Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{151794,
        author = {N.MARY BERNARD},
        title = {SUPER EDGE ANTI MAGIC GRACEFUL LABELING OF SOME SPECIAL GRAPHS},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {8},
        number = {1},
        pages = {1178-1181},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=151794},
        abstract = {Let G(V,E) be a graph with p vertices and q edges. A Super Edge Anti Magic Graceful Labeling (SEAMGL) of a graph G(p ,q) is a one to one and onto function f:E→{ 1,2,3,…,q }  with the property that for each u∈V , ∑_(e∈N(u))〖f(uv)=distinct〗 . Such a labeling is Super Edge Anti Magic Graceful (SEAMG) if  |f(u)+f(v)-f(uv)|=distinct. A graph G is called Super Edge Anti Magic Graceful (SEAMG) if G admits Super Edge Anti Magic Graceful Labeling. In this paper we determine Friendship graph, Dumbbell graph, Middle graph and Prism graph which are Super Edge Anti Magic Graceful. (SEAMG).},
        keywords = {Super edge anti-magic, Graceful labeling, Friendship graph, Dumbbell graph, Middle graph, Prism graph},
        month = {},
        }