The minimum vv-coloring Laplacian energy of a graph

Authors

  • Sayinath Udupa Manipal Institute of Technology - Department of Mathematics
  • R. S. Bhat Manipal Institute of Technology - Department of Mathematics

Keywords:

energy of a graph, Laplacian energy of a graph, Color energy of a graph, vv-coloring of a graph

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.

Downloads

Published

2020-07-31

How to Cite

Udupa, S., & Bhat, R. S. (2020). The minimum vv-coloring Laplacian energy of a graph. Italian Journal of Pure and Applied Mathematics, 44, 1075–1084. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/7389

Issue

Section

Articoli - Forum Editrice

Similar Articles

1 2 3 4 5 6 7 8 9 > >> 

You may also start an advanced similarity search for this article.