@article{article_769094, title={On equitable coloring of book graph families}, journal={Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics}, volume={69}, pages={1228–1234}, year={2020}, DOI={10.31801/cfsuasmas.769094}, author={Baranı, M. and M, Venkatachalam and Rajalakshmı, K.}, keywords={equitable coloring, book graph, middle graph, line graph, central graph}, abstract={A 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 $\left|\left|V_i\right|-\left|V_j\right|\right| \leq 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.}, number={2}, publisher={Ankara University}