Barani, M.M., VenkatachalamRajalakshmi, K.2021-11-292021-11-292020-12-31https://doi.org/10.31801/cfsuasmas.769094http://hdl.handle.net/20.500.12575/76416A proper vertex coloring of a graph is equitable if the sizes of color classes differ by atmost one. The notion of equitable coloring was introduced by Meyer in 1973. A proper h − colorable graph K is said to be equitably h-colorable if the vertex sets of K can be partioned into h independent color classes V 1 , V 2 , . . . , V h such that the condition ∣ ∣ | V i | − ∣ ∣ V j ∣ ∣ ∣ ∣ ≤ 1 holds for all different pairs of i and j and the least integer h is known as equitable chromatic number of K . In this paper, we find the equitable coloring of book graph, middle, line and central graphs of book graph.enEquitable coloringBook graphMiddle graphArticle692122812342618-6470