Abstract
Graph class which has the characteristic of odd harmonious labeling is called as odd harmonious graph. Net graph is a graph which is gained by using operation Cartesian product of two line graphs. The construction of snake-net graph is inspired by the definition of snake graph replacing the round graph to net graph. In this paper, the study will show that snake-net graph fulfill the characteristic of odd harmonious graph in such a way snake-net graph is the odd harmonious graph. In the end of this paper, it is also shown that the union of snake-net graph is also called as the odd harmonious 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 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.
