A Class of Trees Having Strongly Super Total Graceful Labellings
Xiyang Zhao, Junqian Shao, Bing Yao, Xiaomin Wang
Available Online October 2016.
- https://doi.org/10.2991/ceie-16.2017.14How to use a DOI?
- S(Pn) Qerfect Matching; Strongly Graceful Labelling; Super Total Graceful Graphs
- 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.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Xiyang Zhao AU - Junqian Shao AU - Bing Yao AU - Xiaomin Wang PY - 2016/10 DA - 2016/10 TI - A Class of Trees Having Strongly Super Total Graceful Labellings BT - Proceedings of the International Conference on Communication and Electronic Information Engineering (CEIE 2016) PB - Atlantis Press SP - 99 EP - 108 SN - 2352-5401 UR - https://doi.org/10.2991/ceie-16.2017.14 DO - https://doi.org/10.2991/ceie-16.2017.14 ID - Zhao2016/10 ER -