• Mary Bernard N
• Dr. S,D. Deepa

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 Bistar graph, Banana tree graph and Caterpillar graph, Star graph which are Super Edge Anti Magic Graceful. (SEAMG).

Key words: Super edge anti-magic, Graceful labeling, Bistar graph, Comb graph, Caterpillar graph and Star graph

"Super Edge Anti Magic Graceful Labeling of some Tree Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.8, Issue 6, page no.d932-d937, June-2021, Available :http://www.jetir.org/papers/JETIR2106543.pdf

"Super Edge Anti Magic Graceful Labeling of some Tree Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.8, Issue 6, page no. ppd932-d937, June-2021, Available at : http://www.jetir.org/papers/JETIR2106543.pdf