Bounds and color energy of derived graphs

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

doi:10.17777/ascm2019.29.2.199

Bounds and color energy of derived graphs

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

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	199-209
Number of pages	11
Journal	Advanced Studies in Contemporary Mathematics (Kyungshang)
Volume	29
Issue number	2
DOIs	https://doi.org/10.17777/ascm2019.29.2.199
Publication status	Published - 01-01-2019

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.17777/ascm2019.29.2.199

Cite this

@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\textbackslash{} 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 = jan,

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 Research Institute for Mathematical Sciences and Physics",

number = "2",

}

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 - https://www.scopus.com/pages/publications/85067599866

UR - https://www.scopus.com/pages/publications/85067599866#tab=citedBy

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 -

Bounds and color energy of derived graphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this