| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6420168 | Applied Mathematics and Computation | 2015 | 4 Pages |
Abstract
In this note we prove a sharp upper bound for the distance based graph entropy introduced in Chen et al. (2014). Furthermore we resolve one part of the conjecture proposed in the same paper and provide counterexamples for the other part.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Aleksandar IliÄ, Matthias Dehmer,