Vertex weighted Laplacian Energy of union of graphs
The vertex weighted Laplacian energy with respect to the vertex weight $w$ of a graph $G$ with $n$ vertices is defined as ~$LE_w(G)=\sum\limits_{i=1}^n|\mu_i-\bar{w}|$, where ${{\mu }_{1}},{{\mu }_{2}},...,{{\mu }_{n}}$ are the Laplacian eigenvalues of $G$ and $\bar{w}$ is the average value of the w...
Main Author: | Nilanjan De |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2018-05-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/files/csjm/v26-n1/v26-n1-(pp29-38).pdf |
Similar Items
-
The Laplacian eigenvalues of graphs
by: Li, Jianxi
Published: (2010) -
Color signless Laplacian energy of graphs
by: Pradeep G. Bhat, et al.
Published: (2017-08-01) -
New skew Laplacian energy of simple digraphs
by: Qingqiong Cai, et al.
Published: (2013-12-01) -
Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues
by: Yirong Zheng, et al.
Published: (2016-11-01) -
On energy, Laplacian energy and $p$-fold graphs
by: Hilal A Ganie, et al.
Published: (2015-03-01)