Gaussian Anti Magic Labeling on Joining of Eiffel Tower Graph, E – Graph, Fire Cracker Graph and Fork Graph

Abstract

Gaussian antimagic labeling which is defined as . A function                                , so that we interpret the produced function  described by  Solution of all the elements are well defined and different. A graph accepts Gaussian antimagic labeling is known as Gaussian antimagic graph. This study we demonstrate the persistence of Gaussian antimagic labeling for some graphs like Joining of Eiffel Tower graph, E – graph, Fire Cracker graph and Fork graph.