Abstract
graph consists of two sets, namely vertices and edges , which are sets that cannot be empty. The helmet graph is obtained from graph circle with addition side pendants with notation . Something graph side is said to be harmonious if there is an injective function that produces function labeling side which will result in a different sided label. In this thesis, graphs with odd and even results will be constructed as harmonious graphs. Where for every for odd helmet graph and for even helmet graph.
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 callSimilar Papers
More From: Daya Matematis: Jurnal Inovasi Pendidikan Matematika
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.
