Graceful Labelling of Sunflower Graph, GEM Graph, FAN Graph and HELM Graph under IBEDE and SIBEDE Approach

Author Name : S. Adeline Smyrna, U. Mary

ABSTRACT

In this article, an attempt has been taken to study the Incident Binary Equivalent Decimal Edge Graceful Labelling (IBEDE) and Strong Incident Binary Equivalent Decimal Edge Graceful Labelling (SIBEDE) on graphs. A labelling of a graph G=(V,E) is a one-to-one mapping of the vertex set V(G) and edge set E(G) into a set of non-negative numbers. The Graceful Labelling of Sunflower graphs, Gem graphs, Fan graphs and Helm graphs are discussed in this article.    

Keywords: Graceful labelling, Incident Binary Equivalent Decimal Edge Graceful Labelling, Strong Incident Binary Equivalent Decimal Edge Graceful Labelling.