Graceful labeling of hanging ? graphs
No Thumbnail Available
Date
2014
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Research India Publications subscription@ripublication.com
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.
Description
Keywords
Graceful labeling, ?-graphs
Citation
International Journal of Applied Engineering Research, 2014, 9, 11, pp. 1619-1623