Gaussian Anti Magic Labeling on Joining of Cricket Graph, Dart Graph, Diamond Graph and Domino Graph

Abstract

A Gaussian antimagic labeling has introduced by Thirusangu et al. Gaussian antimagic labeling which is defined in a  graph, function can be defined as                                , so that we interpret the induced function  defined by results of all the elements are well defined and different. A graph that accepts Gaussian antimagic labeling is known as Gaussian antimagic graph.  In this paper we demonstrate the persistence of Gaussian antimagic labeling for some special graphs like Joining of Cricket graph, Dart graph, Diamond graph and Domino graph.