On b-chromatic Number of Prism Graph Families

A b-coloring of graph is a proper -coloring that verifies the following property: for every color class , 1≤≤, there exists a vertex , with color , such that all the other colors in are utilized in neighbors. The b-chromatic number of a graph , denoted by (), is the largest integer such that may have a b-coloring by colors. In this paper we discuss the b-coloring of prism graph , central graph of prism graph (), middle graph of prism graph () and the total graph of prism graph () and we obtain the b-chromatic number for these graphs