b-Coloring of the Mycielskian of Some Classes of Graphs
Discussiones Mathematicae. Graph Theory, Tome 42 (2022) no. 2, pp. 363-381
Voir la notice de l'article provenant de la source Library of Science
The b-chromatic number b(G) of a graph G is the maximum k for which G has a proper vertex coloring using k colors such that each color class contains at least one vertex adjacent to a vertex of every other color class. In this paper, we have mainly investigated on the b-chromatic number of the Mycielskian of regular graphs. In particular, we have obtained the exact value of the b-chromatic number of the Mycielskian of some classes of graphs. This includes a few families of regular graphs, graphs with b(G) = 2 and split graphs. In addition, we have found bounds for the b-chromatic number of the Mycielskian of some more families of regular graphs in terms of the bchromatic number of their original graphs. Also we have found b-chromatic number of the generalized Mycielskian of some regular graphs.
Keywords:
b-coloring, b-chromatic number, Mycielskian of graphs, regular graphs
@article{DMGT_2022_42_2_a3,
author = {Raj, S. Francis and Gokulnath, M.},
title = {b-Coloring of the {Mycielskian} of {Some} {Classes} of {Graphs}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {363--381},
publisher = {mathdoc},
volume = {42},
number = {2},
year = {2022},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2022_42_2_a3/}
}
TY - JOUR AU - Raj, S. Francis AU - Gokulnath, M. TI - b-Coloring of the Mycielskian of Some Classes of Graphs JO - Discussiones Mathematicae. Graph Theory PY - 2022 SP - 363 EP - 381 VL - 42 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2022_42_2_a3/ LA - en ID - DMGT_2022_42_2_a3 ER -
Raj, S. Francis; Gokulnath, M. b-Coloring of the Mycielskian of Some Classes of Graphs. Discussiones Mathematicae. Graph Theory, Tome 42 (2022) no. 2, pp. 363-381. http://geodesic.mathdoc.fr/item/DMGT_2022_42_2_a3/