Back to Search
Start Over
An Equivalent of Graceful Tree Conjecture
- Source :
- 2020 IEEE 5th Information Technology and Mechatronics Engineering Conference (ITOEC).
- Publication Year :
- 2020
- Publisher :
- IEEE, 2020.
-
Abstract
- This thesis have mainly discussed a tree is graceful if and only if its subdivision admits an almost-strongly graceful labelling,i.e., an equivalent of Graceful Tree Conjecture. We have done to the correctness of our algorithms by Procedure towards the zero-label, but we do not go to the computer implementation of these algorithms. Two examples show that the application value of equivalence of graceful tree is malleable.
Details
- Database :
- OpenAIRE
- Journal :
- 2020 IEEE 5th Information Technology and Mechatronics Engineering Conference (ITOEC)
- Accession number :
- edsair.doi...........87e710672d5dd132847235b62fe1f2b9