Graceful labeling of hanging ? graphs
| dc.contributor.author | Janakiraman, T.N. | |
| dc.contributor.author | Sathiamoorthy, G. | |
| dc.date.accessioned | 2026-02-05T09:34:29Z | |
| dc.date.issued | 2014 | |
| dc.description.abstract | In 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. | |
| dc.identifier.citation | International Journal of Applied Engineering Research, 2014, 9, 11, pp. 1619-1623 | |
| dc.identifier.issn | 9734562 | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/26629 | |
| dc.publisher | Research India Publications subscription@ripublication.com | |
| dc.subject | Graceful labeling | |
| dc.subject | ?-graphs | |
| dc.title | Graceful labeling of hanging ? graphs |