Janakiraman, T.N.Sathiamoorthy, G.2026-02-052014International Journal of Applied Engineering Research, 2014, 9, 11, pp. 1619-16239734562https://idr.nitk.ac.in/handle/123456789/26629In 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?-graphsGraceful labeling of hanging ? graphs