1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2023
0-rotatability of classes of rooted symmetric trees. Are rooted symmetric trees 0-rotatable?
Rafael I. Rofa
A graceful labelling of a tree T = (V,E), where V is the set of vertices of the tree and E is its edge set, is a bijective function f from V to the set consisting of the numbers 0,…
math.GM2021
A Graceful Algebraic Function Labelling of Rooted Symmetric Trees
Rafael I. Rofa
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 lab…
math.CO2021★ 1 cited
Graceful and Strongly Graceful Permutations
Rafael Rofa
A graceful labelling of a graph G is an injective function f from the set of vertices of G into the set {0,1,...,|EG|} such that if edge uv is assigned the label |f(u)-f(v)| then a…