Bounds and color energy of derived graphs

H. J. Gowtham, Sabitha D'Souza, Pradeep G. Bhat

Research output: Contribution to journalArticle

Abstract

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)
Volume29
Issue number2
DOIs
Publication statusPublished - 01-01-2019

Fingerprint

Graph in graph theory
Energy
Simple Graph
Absolute value
Color
Connected graph
Upper and Lower Bounds
Adjacent
If and only if
Eigenvalue
Vertex of a graph

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Cite this

Gowtham, H. J. ; D'Souza, Sabitha ; Bhat, Pradeep G. / Bounds and color energy of derived graphs. In: Advanced Studies in Contemporary Mathematics (Kyungshang). 2019 ; Vol. 29, No. 2. pp. 199-209.
@article{b02692eaaced407bb26972a89e54b9f4,
title = "Bounds and color energy of derived graphs",
abstract = "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.",
author = "Gowtham, {H. J.} and Sabitha D'Souza and Bhat, {Pradeep G.}",
year = "2019",
month = "1",
day = "1",
doi = "10.17777/ascm2019.29.2.199",
language = "English",
volume = "29",
pages = "199--209",
journal = "Advanced Studies in Contemporary Mathematics (Kyungshang)",
issn = "1229-3067",
publisher = "Jangjeon Mathematical Society",
number = "2",

}

Bounds and color energy of derived graphs. / Gowtham, H. J.; D'Souza, Sabitha; Bhat, Pradeep G.

In: Advanced Studies in Contemporary Mathematics (Kyungshang), Vol. 29, No. 2, 01.01.2019, p. 199-209.

Research output: Contribution to journalArticle

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

VL - 29

SP - 199

EP - 209

JO - Advanced Studies in Contemporary Mathematics (Kyungshang)

JF - Advanced Studies in Contemporary Mathematics (Kyungshang)

SN - 1229-3067

IS - 2

ER -