Sharp Bounds on (Generalized) Distance Energy of Graphs
Given a simple connected graph <i>G</i>, let <inline-formula> <math display="inline"> <semantics> <mrow> <mi>D</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> <...
Main Authors: | Abdollah Alhevaz, Maryam Baghipur, Kinkar Ch. Das, Yilun Shang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/8/3/426 |
Similar Items
-
Merging the Spectral Theories of Distance Estrada and Distance Signless Laplacian Estrada Indices of Graphs
by: Abdollah Alhevaz, et al.
Published: (2019-10-01) -
NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS
by: A. Alhevaz, et al.
Published: (2021-01-01) -
On distance signless Laplacian spectrum and energy of graphs
by: Abdollah Alhevaz, et al.
Published: (2018-10-01) -
Minimum covering reciprocal distance signless Laplacian energy of graphs
by: Alhevaz Abdollah, et al.
Published: (2018-12-01) -
The Generalized Distance Spectrum of the Join of Graphs
by: Abdollah Alhevaz, et al.
Published: (2020-01-01)