Please use this identifier to cite or link to this item: http://idr.nitk.ac.in/jspui/handle/123456789/13653
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHegde, S.M.
dc.contributor.authorShivarajkumar
dc.date.accessioned2020-03-31T08:48:17Z-
dc.date.available2020-03-31T08:48:17Z-
dc.date.issued2013
dc.identifier.citationGraphs and Combinatorics, 2013, Vol.29, 4, pp.933-954en_US
dc.identifier.uri10.1007/s00373-012-1159-x
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/13653-
dc.description.abstractA digraph D with p vertices and q arcs is labeled by assigning a distinct integer value g(v) from {0,1,...,q} to each vertex v. The vertex values, in turn, induce a value g(u, v) on each arc (u, v) where g(u, v) = (g(v)- g(u))(mod q + 1). If the arc values are all distinct then the labeling is called a graceful labeling of a digraph. Bloom and Hsu (SIAM J Alg Discr Methods 6:519-536, 1985) conjectured that, all unicyclic wheels are graceful. Also, Zhao et al. (J Prime Res Math 4:118-126, 2008) conjectured that, for any positive even n and any integer m ? 14, the digraph n-{long rightwards arrow}Cm} is graceful. In this paper, we prove both the conjectures. � 2012 Springer.en_US
dc.titleTwo Conjectures on Graceful Digraphsen_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.