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
-
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 matching polynomial of a distance-regular graph
by: Robert A. Beezer, et al.
Published: (2000-01-01) -
On the Normalized Laplacian Spectrum of the Zero-Divisor Graph of the Commutative Ring <inline-formula><math display="inline"><semantics><msub><mstyle mathvariant="bold"><mi mathvariant="double-struck">Z</mi></mstyle><mrow><msubsup><mi mathvariant="bold-italic">p</mi><mn mathvariant="bold">1</mn><msub><mi mathvariant="bold-italic">T</mi><mn mathvariant="bold">1</mn></msub></msubsup><msubsup><mi mathvariant="bold-italic">p</mi><mn mathvariant="bold">2</mn><msub><mi mathvariant="bold-italic">T</mi><mn mathvariant="bold">2</mn></msub></msubsup></mrow></msub></semantics></math></inline-formula>
by: Ali Al Khabyah, et al.
Published: (2025-01-01) -
On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125}
by: V.V. Bitkina, et al.
Published: (2017-03-01) -
Introducing a Novel Clustering Method for Distribution Networks to
Enhance Network Performance and Ensure Load Supply in the Event of
Contingencies: A Fuzzy Function-Based Approach
by: Mohamad Reza Mohamadi, et al.
Published: (2024-09-01)