The equitable coloring is a variant of proper coloring. The graph G is called equitably k-colorable if the vertex set  can be partitioned into k non empty independent sets  such that  for every i and j. The smallest integer k for which G is equitably k-colorable is called the equitable chromatic number of G and is denoted by  The present work is aimed to investigate equitable chromatic number of some wheel related graphs.

proper coloring, chromatic number, equitable coloring, equitable chromatic number.