Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/11422
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHegde, S.M.
dc.contributor.authorKumudakshi
dc.date.accessioned2020-03-31T08:31:21Z-
dc.date.available2020-03-31T08:31:21Z-
dc.date.issued2015
dc.identifier.citationElectronic Notes in Discrete Mathematics, 2015, Vol.48, , pp.151-156en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/11422-
dc.description.abstractBloom and Hsu while extending the graceful labelings of graphs to digraphs, specified the relation between graceful unicycles and complete mappings by establishing the relation of each to a particular class of permutations. We denote C?m(r;m) as a digraph with two directed cycles, one with vertices v1,v2,. . .,vr-1,vr,vr+1,. . .,vm and another directed cycle with vertices v1,v21,. . .,vr-11,vr,vr+11,. . .,vm1 of same length, such that both the directed cycles have v1 and vr as the two common vertices (where m ? 4, 3 ? r ? m-1). In this paper we use complete mappings to deduce a partition of Z<inf>n</inf>, where n=2m+1 odd and show that the digraph C?m(r;m) is graceful. 2015 Elsevier B.V.en_US
dc.titleGraceful digraphs and complete mappingsen_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.