Hegde, S.M.Kumudakshi, K.2026-02-052016Journal of Discrete Mathematical Sciences and Cryptography, 2016, 19, 1, pp. 103-1169720529https://doi.org/10.1080/09720529.2015.1101888https://idr.nitk.ac.in/handle/123456789/26077Abstract: 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 Z<inf>v</inf>\ {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 C<inf>m</inf> is not graceful for m?1, 2 (mod 4) we show that the symmetric digraph based on cycle C<inf>m</inf> i.e the double cycle, DC<inf>m</inf> 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.AlgebraClock and data recovery circuits (CDR circuits)Set theoryAlgebraic structuresCDRCyclic difference setsDifference setsDouble cycleGraceful digraphGraceful labelingLabeled graphsSymmetric digraphsZero-sequencingDirected graphs