Harmonious colouring of line graph of commuting and non-commuting graph of D_{2n}
Serdica Mathematical Journal, Tome 48 (2023) no. 4, pp. 271-278.

Voir la notice de l'article provenant de la source Bulgarian Digital Mathematics Library

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}\).
Keywords: harmonious coloring, harmonious chromatic number, Dihedral group, line graph, 05C25, 05C76
@article{SMJ2_2023_48_4_a0,
     author = {Divya, R. and Chithra Devi, P.},
     title = {Harmonious colouring of line graph of commuting and non-commuting graph of {D_{2n}}},
     journal = {Serdica Mathematical Journal},
     pages = {271--278},
     publisher = {mathdoc},
     volume = {48},
     number = {4},
     year = {2023},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SMJ2_2023_48_4_a0/}
}
TY  - JOUR
AU  - Divya, R.
AU  - Chithra Devi, P.
TI  - Harmonious colouring of line graph of commuting and non-commuting graph of D_{2n}
JO  - Serdica Mathematical Journal
PY  - 2023
SP  - 271
EP  - 278
VL  - 48
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SMJ2_2023_48_4_a0/
LA  - en
ID  - SMJ2_2023_48_4_a0
ER  - 
%0 Journal Article
%A Divya, R.
%A Chithra Devi, P.
%T Harmonious colouring of line graph of commuting and non-commuting graph of D_{2n}
%J Serdica Mathematical Journal
%D 2023
%P 271-278
%V 48
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SMJ2_2023_48_4_a0/
%G en
%F SMJ2_2023_48_4_a0
Divya, R.; Chithra Devi, P. Harmonious colouring of line graph of commuting and non-commuting graph of D_{2n}. Serdica Mathematical Journal, Tome 48 (2023) no. 4, pp. 271-278. http://geodesic.mathdoc.fr/item/SMJ2_2023_48_4_a0/