activity
20132023
most citedGraceful and Strongly Graceful Permutations

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2023Show all

1 paper · 1 filter

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,…