A class of trees having strongly super total graceful labellings

摘要

Total graceful labelling is a new graph labelling of graph theory. We define strongly the total graceful labelling and determine the existence of a class of trees having perfect matchings and strongly total graceful labellings. Our methods can be easily transferred into efficient algorithms.