SOME NEW RESULTS ON b-COLORING OF GRAPHS
A proper coloring is called a b-coloring if there exists a vertex that has neighbour(s) in all other color classes. The b-chromatic number of a graph is the largest integer for which graph admits a b-coloring. We investigate the b-chromatic numbers for some graphs obtained from wheel and flower graph.
b-coloring, b-continuity, b-spectrum.
