The B-Chromatic Number of some Graphs
Samir K. VAIDYA, Rakhimol V. Isaac · International Journal of Mathematics and Soft Computing · 2015
A proper coloring of a graph G is called b-coloring if each color class contains a vertex which is adjacent to at least one vertex of every other color classes. We investigate b-chromatic number of some cycle and path related graphs.