关于图的熵的Yan猜想的解决
Resolution of Yan's conjecture on entropy of graphs
摘要:
一个图的第一个度熵是它的度序列的Shannon熵,该度序列被度和归一化。本文刻画了具有给定阶数$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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。