Let G be a finite connected simple graph. The color energy of a graph G is defined as the sum of absolute values of color eigenvalues of G. The derived graph of a simple graph G, denoted by G\ is a graph having same vertex set as G, in which two vertices are adjacent if and only if their distance in G is two. In this paper, we establish an upper and lower bounds for color energy of a graph and obtain color energy of derived graphs of some families of graphs.
|Number of pages||11|
|Journal||Advanced Studies in Contemporary Mathematics (Kyungshang)|
|Publication status||Published - 01-01-2019|
All Science Journal Classification (ASJC) codes