Odd-graceful labelings of trees of diameter 5
| dc.creator | Barrientos, Christian | |
| dc.date | 2008-07-23 | |
| dc.date | 2008-07-23 | |
| dc.date.accessioned | 2026-07-07T09:52:24Z | |
| dc.date.available | 2026-07-07T09:52:24Z | |
| dc.description | A difference vertex labeling of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy the weight |f(x)-f(y)|. A difference vertex labeling f of a graph G of size n is odd-graceful if f is an injection from V(G) to {0,1,...,2n-1} such that the induced weights are {1,3,...,2n-1}. We show here that any forest whose components are caterpillars is odd-graceful. We also show that every tree of diameter up to five is odd-graceful. | |
| dc.description | 6 pages, 6 figures | |
| dc.identifier | https://arxiv.org/abs/0807.3738 | |
| dc.identifier | http://arxiv.org/abs/0807.3738 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/165584 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C78 | |
| dc.title | Odd-graceful labelings of trees of diameter 5 | |
| dc.type | text |