Abstract
A rooted tree with diameter D is said to have an even degree sequence if every vertex has even degree except for one root and the leaves, which are in the last level ⌊ D / 2 ⌋ . The degree sequence is said to be quasi even if every vertex has even degree except for one root, every vertex in level ⌊ D / 2 ⌋ − 1 and the leaves, which are in the last level ⌊ D / 2 ⌋ . Hrnčiar and Haviar [P. Hrnčiar, A. Haviar, All trees of diameter five are graceful, Discrete Math. 233 (2001) 133–150] give a method to construct a graceful labeling for every tree with diameter five. Based upon their method we prove that every tree having an even or quasi even degree sequence is graceful. To do that we find for a tree of even diameter and rooted in its central vertex t of degree δ ( t ) up to δ ( t ) ! graceful labelings if the tree has an even or quasi even degree sequence.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.