Abstract
For any graph G, χ_h (G) is the extremely small number of colors used in a graph such that no two nearby vertices gets a similar color and every mix of color appears to be together on atmost one edge. In this article we have decided the harmonious chromatic number of subdivision of certain groups of graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
