Abstract
Harmonious coloring of graph \(G\) is a proper vertex coloring, where each pair of colors occurs at most on one pair of adjacent vertices. Minimum number of colors required for Harmonious coloring of \(G\) is the harmonious chromatic number, \(\chi_{H}(G)\). Here we determine the Harmonious chromatic number of the line graph of commuting graph and non-commuting graph of the dihedral group, \(D_{2n}\).
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have