Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al.  have introduced the concept of color energy of a graph Ec(G) and computed the color energy of few families of graphs with χ(G) colors. In this paper we derive explicit formulas for the color energies of the unitary Cayley graph Xn, the complement of the colored unitary Cayley graph (Xn)c and some gcd-graphs.