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: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-03-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/8/3/426 |