Let G be a graph of order p and size q. A graceful labeling of G is an injection f : V → {0,1,...,q}such that while each edge uv is assigned the label(absolute difference of the corresponding vertex labels), the induced edge labels are all distinct. Such a function gf is called the induced edge function and a graph which admits such a labeling is called a graceful graph. This chapter investigates the gracefulness of graphs using pronic numbers.