Name
Abstract | ||
|---|---|---|
Bloom 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 Zn, where n=2m+1 odd and show that the digraph C→m(r;m) is graceful. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.endm.2015.05.021 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Graceful digraphs,complete mappings,partitions of Zn | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Permutation,Partition (number theory),Digraph,Mathematics | Journal |
Volume | ISSN | Citations |
48 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. M. Hegde | 1 | 32 | 9.96 |
| Kumudakshi | 2 | 0 | 0.68 |