Abstract
In this article, our main topic is about the existence of relaxed skolem mean labeling for a 5 – star graph G = K1,α ∪ K1,α ∪ K1,α ∪ K1, β ∪ K1, β 1 2 3 1 2 with partition 3, 2 with a certain condition. By using the trial and error method we find the existence of the relaxed skolam mean labeling of 5 - star graph with partition 3, 2 with a specific condition.
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: International Journal of Engineering and Advanced Technology
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.