On Color Energy of Few Classes of Bipartite Graphs and Corresponding Color Complements

Abstract

λ where λ i is a color eigenvalue of the color matrix of G, A c (G) with entries as 1, if both the corresponding vertices are neighbors and have different colors; -1, if both the corresponding vertices are not neighbors and have same colors and 0, otherwise. In this article, we study color energy of graphs with proper coloring and L (h, k)-coloring. Further, we examine the relation between E c (G) with the color energy of the color complement of a given graph G and other graph parameters such as chromatic number and domination number.