On graceful unicyclic wheels
| dc.contributor.author | Hegde, S.M. | |
| dc.contributor.author | Kumar, S. | |
| dc.date.accessioned | 2026-02-05T09:34:08Z | |
| dc.date.issued | 2014 | |
| dc.description.abstract | A digraph D with e edges is labeled by assigning a distinct integer value ?(?) from (0, l,...,e) to each vertex ?. The vertex values, in turn, induce a value 0(?) ?) on each edge (?, ?) where ? (?, ?) = ?(?) - ? (?)mod(e + 1). If the edge values are all distinct and nonzero, then the labeling is called a graceful labeling of a digraph. In 1985, Bloom and Hsu conjectured that " All unicyclic wheels are gracefulIn this paper we prove the conjecture. © © 2014, Charles Babbage Research Centre. | |
| dc.identifier.citation | Ars Combinatoria, 2014, 117, , pp. 47-64 | |
| dc.identifier.issn | 3817032 | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/26468 | |
| dc.publisher | Charles Babbage Research Centre | |
| dc.subject | Graceful labeling of graphs (digraphs) | |
| dc.subject | Unicyclic wheels | |
| dc.title | On graceful unicyclic wheels |