TY - JOUR
T1 - Bounds and color energy of derived graphs
AU - Gowtham, H. J.
AU - D'Souza, Sabitha
AU - Bhat, Pradeep G.
PY - 2019/1/1
Y1 - 2019/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85067599866&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85067599866&partnerID=8YFLogxK
U2 - 10.17777/ascm2019.29.2.199
DO - 10.17777/ascm2019.29.2.199
M3 - Article
AN - SCOPUS:85067599866
SN - 1229-3067
VL - 29
SP - 199
EP - 209
JO - Advanced Studies in Contemporary Mathematics (Kyungshang)
JF - Advanced Studies in Contemporary Mathematics (Kyungshang)
IS - 2
ER -