Further results on color energy of graphs

Given a colored graph G, its color energy E_c(G) is defined as the sum of the absolute values of the eigenvalues of the color matrix of G. The concept of color energy was introduced by Adiga et al. [1]. In this article, we obtain some new bounds for the color energy of graphs and establish relationship between color energy E_c(G) and energy E(G) of a graph G. Further, we construct some new families of graphs in which one is non-co-spectral color-equienergetic with some families of graphs and another is color-hyperenergetic. Also we derive explicit formulas for their color energies.