Elsevier

Discrete Mathematics

Volume 231, Issues 1–3, 28 March 2001, Pages 199-219
Discrete Mathematics

Modular gracious labellings of trees

https://doi.org/10.1016/S0012-365X(00)00318-6Get rights and content
Under an Elsevier user license
open archive

Abstract

A gracious labelling g of a tree is a graceful labelling in which, treating the tree as a bipartite graph, the label of any edge (d,u) (d a ‘down’ and u an ‘up’ vertex) is g(u)−g(d). A gracious k-labelling is one such that each residue class modulo k has the ‘correct’ numbers of vertex and edge labels — that is, the numbers that arise by interpreting the labels of a gracious labelling modulo k. In this paper it is shown that every non-null tree has a gracious k-labelling for each k=2,3,4,5.

MSC

05C78

Cited by (0)