Characterization of E-super vertex magic labelling of odd order binary trees
Abstract
In the field of Graph Theory, a tree is a connected acyclic undirected graph. Any tree with odd vertices is conjectured to be an E-super vertex magic. In this paper, we verified that the E-super vertex magic labelling does not exist for the perfect binary trees and extended the work to identify the possibility of finding E-super vertex magic labelling for odd order binary trees.
DOI: https://doi.org/10.4038/cjs.v51i4.8056 | Journal eISSN: 2513-230X
Language: English
Page range: 389 - 393
Published on: Dec 15, 2022
Published by: Faculty of Science, University of Peradeniya, Sri Lanka
In partnership with: Paradigm Publishing Services
© 2022 S. K. O. D. Samarathunge, A. M. C. U. M. Athapattu, A. A. I. Perera, published by Faculty of Science, University of Peradeniya, Sri Lanka
This work is licensed under the Creative Commons Attribution 4.0 License.