Proceedings of the International Conference on Communication and Electronic Information Engineering (CEIE 2016)

<Previous Article In Volume
Next Article In Volume>

A Class of Trees Having Strongly Super Total Graceful Labellings

Authors
Xiyang Zhao, Junqian Shao, Bing Yao, Xiaomin Wang
Corresponding Author
Xiyang Zhao
Available Online October 2016.
DOI
10.2991/ceie-16.2017.14How to use a DOI?
Keywords
S(Pn) Qerfect Matching; Strongly Graceful Labelling; Super Total Graceful Graphs
Abstract

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.

Copyright
© 2017, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the International Conference on Communication and Electronic Information Engineering (CEIE 2016)
Series
Advances in Engineering Research
Publication Date
October 2016
ISBN
978-94-6252-312-8
ISSN
2352-5401
DOI
10.2991/ceie-16.2017.14How to use a DOI?
Copyright
© 2017, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

risenwbib
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  - 10.2991/ceie-16.2017.14
ID  - Zhao2016/10
ER  -