On Cubic Graceful Labeling

Abstract

A graph with n vertex and m edges is said to be cubic graceful labeling if its vertices are labeled with distinct integers {0,1,2,3,……..,m3} such that for each edge f*( uv) induces edge mappings are {13,23,33,……,m3}. A graph admits a cubic graceful labeling is called a cubic graceful graph. In this paper, we proved that < K1,a , K1,b , K1c , K1,d>, associate urp with u(r+1)1 of K1,P, fixed vertices vr and ur of two copies of Pn are cubic graceful.