The b-Chromatic Number of Some Standard Graphs
b-Coloring of G is a coloring which is proper such that in each color class there exists a vertex which is called as representative vertex that has at least one neighbor in each of the remaining color classes. The highest positive integer k such that the k-colors can be used to color the vertices of G along with b-coloring is the b-chromatic number of G, denoted by b(G). For a given graph G with n vertices, G∗ is constructed (Jeeva et al., Indian J Math 59(2):255–261, 2017). In the research paper, we find out the b-chromatic number of Mycielskian, splitting, shadow, middle, and total graph of G∗.
- 3.Havet, F., Sales, C.L., Sampaio, L.: b-coloring of tight graphs. Discrete Applied Mathematics 160(18) (2012) 2709–2715Google Scholar
- 4.Amine El Sahili, A., Kouider, M.: About b-colouring of regular graphs. Utilitas Mathematica 80 (11 2009)Google Scholar
- 10.Vaidya, S.K., Shukla, M.S.: b-chromatic number of splitting graph of wheel. Mathematical Combinatorics 2 (2015) 69–76Google Scholar