Please use this identifier to cite or link to this item: http://idr.nitk.ac.in/jspui/handle/123456789/10366
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHegde, S.M.
dc.contributor.authorKumudakshi
dc.date.accessioned2020-03-31T08:19:01Z-
dc.date.available2020-03-31T08:19:01Z-
dc.date.issued2016
dc.identifier.citationJournal of Discrete Mathematical Sciences and Cryptography, 2016, Vol.19, 1, pp.103-116en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/10366-
dc.description.abstractAbstract: In the early 1980?s Bloom and Hsu extended the notation of graceful labelings to directed graphs, and gave a relationship between graceful digraphs and a variety of algebraic structures. In this paper using a cyclic (v, k, ?) difference set with ? copies of elements of Zv\ {0}, we construct graceful digraphs of k vertices and v 1 arcs. It is known that if gracefully labelled graph has e edges then its symmetric digraph is graceful with the same vertex labels. Although, the cycle Cm is not graceful for m?1, 2 (mod 4) we show that the symmetric digraph based on cycle Cm i.e the double cycle, DCm which is constructed from a m-cycle by replacing each edge by a pair of arcs, edge xy gives rise to arcs (x, y) and (y, x), is graceful for any m vertices specifically for m?1, 2 (mod 4). 2016 TARU Publications.en_US
dc.titleConstruction of graceful digraphs using algebraic structuresen_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.