Abstract
A graph G is called harmonious graph if there is an injective mapping f from the set of vertices of G to the set Zq so that the mapping induced a bijection mapping f ∗ from the set of edges of G to Zq , which is defined as f*(xy) = f(x)+ f(y) for each edge xy∈ E(G). The mapping f is called harmonious labeling. Harmonious labeling concept has been developed since 1980. At that time, harmonious labeling is inspired by channel assignment problems. Nowadays, harmonious labeling has been known for various classes of graphs. However, there are still many certain classes of graphs that have not been determined yet whether they can be harmonious labeled or not. One of the class of graphs that have not been determined yet whether it can be harminous labeled or not is graph Cm ∪ Pn In this paper, we prove that there is a harmonious labeling of graph Cm ∪ Pn for some values m and n.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
