On comparison between the distance energies of a connected graph
Let G be a simple connected graph of order n having Wiener index W(G). The distance, distance Laplacian and the distance signless Laplacian energies of G are respectively defined asDE(G)=∑i=1n|υiD|,DLE(G)=∑i=1n|υiL−Tr‾|andDSLE(G)=∑i=1n|υiQ−Tr‾|, where υiD,υiL and υiQ,1≤i≤n are respectively the dista...
Saved in:
| Main Authors: | Hilal A. Ganie, Bilal Ahmad Rather, Yilun Shang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2024-11-01
|
| Series: | Heliyon |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2405844024163475 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On spectrum and energies of enhanced power graphs
by: Pankaj Kalita, et al.
Published: (2025-01-01) -
Spectral and Sharp Sufficient Conditions for Graphs to Admit a Strong Star Factor
by: Fengyun Ren, et al.
Published: (2025-05-01) -
On the neighbourhood degree sum-based Laplacian energy of graphs
Published: (2025-01-01) -
A Note on the Laplacian Energy of the Power Graph of a Finite Cyclic Group
by: Şerife Büyükköse, et al.
Published: (2024-04-01) -
The Resistance Distance Is a Diffusion Distance on a Graph
by: Ernesto Estrada
Published: (2025-07-01)