  Let T=(V,E) be a tree with vertex set V and edge set E. A graceful labelling
f of T is an injective function f from V into {0, 1, ..., |E|} such that if
edge uv is assigned the label g(uv)=|f(u)-f(v)| then the function g from E into
{1, ..., |E|} is also injective (that is all edge labels are distinct). A
rooted symmetric tree is a tree in which all vertices at the same level from
root vertex have the same degree. It has been known since 1979 that rooted
symmetric trees are graceful. However, the proofs that have been presented for
this fact are either indirect inductive proofs or algorithmic descriptive
proofs showing the many separate steps involved in labelling the vertices.
Given a rooted symmetric tree, we find a graceful labelling f of T in the form
of a direct algebraic function that algebraically maps each vertex of T to a
unique label. Interestingly, f turns out to be a generalisation of the way a
path is canonically gracefully labelled as algorithmically described by A. Rosa
who is a pioneer in this field of research. The algebraic function that defines
the graceful labelling is used to show that a class of rooted symmetric trees
that contains the class of binomial trees has weakly {\alpha}-labelling and it
can provide a concise practical, computational way of producing graceful
labelling of large rooted symmetric trees in, relatively, minimal time.
