The minimum vv-coloring Laplacian energy of a graph
Keywords:
energy of a graph, Laplacian energy of a graph, Color energy of a graph, vv-coloring of a graphAbstract
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.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 Sayinath Udupa, R. S. Bhat

This work is licensed under a Creative Commons Attribution 4.0 International License.
L'opera è pubblicata sotto Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)

