A study on the Graceful Labeling Problems in Graph Theory

Abstract

A. Rosa proposed a new graph labelling method called ß labeling in 1966, in which the vertices are labelled with different integers ranging from 0 to ????, where m is the number of edges, and each edge is labelled with the absolute difference of the labels of its end vertices, making it unique in the graph. S. W. Golomb changed ß labelling to elegant labelling, as it is known now, a few years later