Udupa, Synthiya and Bhat, R S (2020) The minimum vv-coloring Laplacian energy of a graph. Italian Journal of Pure and Applied Mathematics (44). pp. 1075-1084. ISSN 1126-8042
![]() |
PDF
9873.pdf - Published Version Restricted to Registered users only Download (74kB) | Request a copy |
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
Item Type: | Article |
---|---|
Uncontrolled Keywords: | energy of a graph, Laplacian energy of a graph, Color energy of a graph, vv-coloring of a graph. |
Subjects: | Engineering > MIT Manipal > Mathematics |
Depositing User: | MIT Library |
Date Deposited: | 24 Nov 2020 07:04 |
Last Modified: | 24 Nov 2020 07:04 |
URI: | http://eprints.manipal.edu/id/eprint/156054 |
Actions (login required)
![]() |
View Item |