Janakiraman, T.N.Sathiamoorthy, G.2020-03-312020-03-312014International Journal of Applied Engineering Research, 2014, Vol.9, 11, pp.1619-1623https://idr.nitk.ac.in/handle/123456789/11424In this paper, we introduce a new class of graphs called hanging ?-graphs which is obtained by attaching C4 with chord, to each of the n teeth of comb graph Pn ? L1. We prove that those graphs admit graceful labeling. Research India Publications.Graceful labeling of hanging ? graphsArticle