Bounds and color energy of derived graphs

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)199-209
Number of pages11
JournalAdvanced Studies in Contemporary Mathematics (Kyungshang)
Issue number2
Publication statusPublished - 01-01-2019

All Science Journal Classification (ASJC) codes

  • Mathematics(all)


Dive into the research topics of 'Bounds and color energy of derived graphs'. Together they form a unique fingerprint.

Cite this