The minimum vv-coloring Laplacian energy of a graph

Sayinath Udupa, R. S. Bhat

Research output: Contribution to journalArticlepeer-review

Abstract

Let B(G) denote the set of all blocks of a graph G. Two vertices are vv-adjacent if they incident on the same block. Then vv-degree of a vertex u, dvv(u) is the number vertices vv-adjacent to the vertex u. In this paper we introduce new kind of graph energy, the minimum vv-coloring Laplacian energy of a graph denoting it as LEcvv(G). It depends both on underlying graph of G and its particular colors on its vertices of G. We studied some of the properties of LEcvv(G) and bounds for LEcvv(G) are established.

Original languageEnglish
Pages (from-to)1075-1084
Number of pages10
JournalItalian Journal of Pure and Applied Mathematics
Issue number44
Publication statusPublished - 2020

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'The minimum vv-coloring Laplacian energy of a graph'. Together they form a unique fingerprint.

Cite this