The b-Chromatic Number of Central Graph of Some Special Graphs

Abstract

Let $G= (V, E)$ be an undirected and loopless graph. The b- chromatic number of a graph G is the largest integer k such that G admits a proper k- coloring in which every color class contains atleast one vertex adjacent to some vertex in all the other color classes .In this paper we investigate the b-chromatic number of central graph of cycle, path, snake, wheel, helm and denoted as C(C${}_{n}$), C(P${}_{n}$), C(T${}_{n}$), C(W${}_{n}$) and C(H${}_{n}$) respectively.