On the main distance-based entropies: the eccentricity- and Wiener-entropy

Abstract

We define the Wiener-entropy, which is together with the eccentricity-entropy one of the most natural distance-based graph entropies. By deriving the (asymptotic) extremal behaviour, we conclude that the Wiener-entropy of graphs of a given order is more spread than is the case for the eccentricity-entropy. We solve $3$ conjectures on the eccentricity-entropy and give a conjecture on the Wiener-entropy related to some surprising behaviour on the graph minimizing it.

arXiv comment16 pages, 4 figures, 3 tables v2: computer verifications have been added