Research Articles
Characterization of E-super vertex magic labelling of odd order binary trees
Authors:
S. K. O. D. Samarathunge,
University of Oklahoma, Norman, US
About S. K. O. D.
David and Judi Proctor Department of Mathematics, Dodge Family College of Arts and Sciences
A. M. C. U. M. Athapattu ,
University of Peradeniya, Peradeniya, LK
About A. M. C. U. M.
Department of Mathematics, Faculty of Science
A. A. I. Perera
University of Peradeniya, Peradeniya, LK
About A. A. I.
Department of Mathematics, Faculty of Science
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.
How to Cite:
Samarathunge, S. K. O. D., Athapattu, A. M. C. U. M., & Perera, A. A. I. (2022). Characterization of E-super vertex magic labelling of odd order binary trees. Ceylon Journal of Science, 51(4), 389–393. DOI: http://doi.org/10.4038/cjs.v51i4.8056
Published on
15 Dec 2022.
Peer Reviewed
Downloads
