The b-chromatic number of Mycielskian of some graphs
P.C. Lisna, Muraleedharan Shetty Sunitha · International Journal of Convergence Computing · 2016
A b-colouring of a graph G is a proper colouring of the vertices of G such that there exists a vertex in each colour class joined to at least one vertex in each other colour classes.The b-chromatic number of a graph G, denoted by φ(G) is the largest integer k such that G has a b-colouring with k colours.The Mycielskian or Mycielski graph µ(H) of a graph H with vertex setIn this paper, we obtain the b-chromatic number of Mycielskian of paths, complete graphs, complete bipartite graphs and wheels.