Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/11424
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJanakiraman, T.N.
dc.contributor.authorSathiamoorthy, G.
dc.date.accessioned2020-03-31T08:31:21Z-
dc.date.available2020-03-31T08:31:21Z-
dc.date.issued2014
dc.identifier.citationInternational Journal of Applied Engineering Research, 2014, Vol.9, 11, pp.1619-1623en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/11424-
dc.description.abstractIn 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.en_US
dc.titleGraceful labeling of hanging ? graphsen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.