Please use this identifier to cite or link to this item: http://idr.nitk.ac.in/jspui/handle/123456789/11372
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHegde, S.M.
dc.contributor.authorShivarajkumar
dc.date.accessioned2020-03-31T08:31:14Z-
dc.date.available2020-03-31T08:31:14Z-
dc.date.issued2016
dc.identifier.citationInternational Journal of Applied and Computational Mathematics, 2016, Vol.2, 3, pp.315-325en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/11372-
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))(modq+1). If the arc values are all distinct then the labeling is called a graceful labeling of a digraph. In this paper, we prove a general result on graceful digraphs of which Du and Sun s conjecture (J. Beijing Univ. Posts Telecommun, 17: 85 88 1994) is a special case. Further, we provide an upper bound for the number of non isomorphic graceful directed cycles obtained from a graceful labeling of the unicycle C n ?. 2015, Springer India Pvt. Ltd.en_US
dc.titleFurther Results 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.