The b-Coloring of graphs in Bistar and Its Various Properties

Abstract

A graph's b-coloring iswhenG its vertices are properly colored so that every color class has a vertex connected to at least one vertex in every other color class. In graph Gthe b – chromatic number denoted by ????(G),is the maximal integer k such that G may have a b – coloring with k- colors. In the present study, we derive the b-chromatic number for the corona product of the Bistar graph, which is represented by the following:????(Bn,n ° Pn), ???? (Bn,n ° Cn), ???? (Pn ° Bn,n), ????(Cn° Bn,n)respectively.