

























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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。