Color Laplacian energy of a graph

Pradeep G. Bhat; Sabitha D'Souza

Color Laplacian energy of a graph

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

Abstract

In this paper, we introduce a new concept of color Laplacian energy LE_c(G). It depends on the underlying graph G and colors of the vertices. We compute color Laplacian spectrum and color Laplacian energies of families of graph with minimum number of colors. We also obtain some bounds of color Laplacian energy. The color Laplacian energy for the colored complement of few families of graphs are also obtained.

Original language	English
Pages (from-to)	321-330
Number of pages	10
Journal	Proceedings of the Jangjeon Mathematical Society
Volume	18
Issue number	3
Publication status	Published - 01-01-2015

All Science Journal Classification (ASJC) codes

Mathematics(all)

Cite this

@article{805bd523a0414e32b8bdf8ee07ad0191,

title = "Color Laplacian energy of a graph",

abstract = "In this paper, we introduce a new concept of color Laplacian energy LEc(G). It depends on the underlying graph G and colors of the vertices. We compute color Laplacian spectrum and color Laplacian energies of families of graph with minimum number of colors. We also obtain some bounds of color Laplacian energy. The color Laplacian energy for the colored complement of few families of graphs are also obtained.",

author = "Bhat, {Pradeep G.} and Sabitha D'Souza",

year = "2015",

month = jan,

day = "1",

language = "English",

volume = "18",

pages = "321--330",

journal = "Proceedings of the Jangjeon Mathematical Society",

issn = "1598-7264",

publisher = "Jangjeon Mathematical Society",

number = "3",

}

TY - JOUR

T1 - Color Laplacian energy of a graph

AU - Bhat, Pradeep G.

AU - D'Souza, Sabitha

PY - 2015/1/1

Y1 - 2015/1/1

N2 - In this paper, we introduce a new concept of color Laplacian energy LEc(G). It depends on the underlying graph G and colors of the vertices. We compute color Laplacian spectrum and color Laplacian energies of families of graph with minimum number of colors. We also obtain some bounds of color Laplacian energy. The color Laplacian energy for the colored complement of few families of graphs are also obtained.

AB - In this paper, we introduce a new concept of color Laplacian energy LEc(G). It depends on the underlying graph G and colors of the vertices. We compute color Laplacian spectrum and color Laplacian energies of families of graph with minimum number of colors. We also obtain some bounds of color Laplacian energy. The color Laplacian energy for the colored complement of few families of graphs are also obtained.

UR - http://www.scopus.com/inward/record.url?scp=84938517973&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938517973&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84938517973

SN - 1598-7264

VL - 18

SP - 321

EP - 330

JO - Proceedings of the Jangjeon Mathematical Society

JF - Proceedings of the Jangjeon Mathematical Society

IS - 3

ER -

Color Laplacian energy of a graph

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this