Abstract
An edge magic total labeling of a graph G(p, q) is said to be an Odd edge magic total labeling if λ(E) = {1,3, …2q – 1} with the condition that for each edge uv ∈ E, λ(u) + λ(uv) +λ(v) = ke, where ke is known as the magic constant. In this paper we resolute cycles of odd length, disjoint union of C3 ∪ C4r+2 (r ≥ 1), disjoint union of C4 ∪ C4r-1 (r > 1), disjoint union of C3 ∪ C4r (r > 1), disjoint union of C4 ∪ C4r-3 (r > 1), are Odd edge magic graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Mathematical Sciences & Computational Mathematics
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.