Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHegde, S.M.-
dc.contributor.authorKumar, S.-
dc.identifier.citationArs Combinatoria, 2014, Vol.117, , pp.47-64en_US
dc.description.abstractA digraph D with e edges is labeled by assigning a distinct integer value ?(?) from (0, l,...,e) to each vertex ?. The vertex values, in turn, induce a value 0(?) ?) on each edge (?, ?) where ? (?, ?) = ?(?) - ? (?)mod(e + 1). If the edge values are all distinct and nonzero, then the labeling is called a graceful labeling of a digraph. In 1985, Bloom and Hsu conjectured that " All unicyclic wheels are gracefulIn this paper we prove the conjecture. Copyright 2014, Charles Babbage Research Centre.en_US
dc.titleOn graceful unicyclic wheelsen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
14 On Gracefull Unicyclic Wheels.pdf6.29 MBAdobe PDFThumbnail

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