论文标题
在图表熵上的Yan猜想的分辨率
Resolution of Yan's conjecture on entropy of graphs
论文作者
论文摘要
图的第一度熵是其度序列的香农熵，该度序列通过度量总和标准化。在本文中，我们以给定的订单$ n $和尺寸$ m $来表征连接的图形，每当$ n-1 \ le m \ le 2n-3，$，从而将基于第一学位的熵最小化，从而扩展并证明了Yan的猜想。
The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. In this paper, we characterize the connected graphs with given order $n$ and size $m$ that minimize the first degree-based entropy whenever $n-1 \le m \le 2n-3,$ thus extending and proving a conjecture by Yan.
