论文标题
给定尺寸的图形的极端熵
Extremal entropy for graphs with given size
论文作者
论文摘要
图的第一度熵是其度序列的香农熵，该度序列通过度量总和标准化。其正确的解释作为度量序列统一性的衡量，需要确定其自然限制的极端值。在本文中，我们证明具有给定尺寸的图形最小化第一度熵的图是COLEX图。
The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. Its correct interpretation as a measure of uniformity of the degree sequence requires the determination of its extremal values given natural constraints. In this paper, we prove that the graphs with given size that minimize the first degree-based entropy are the colex graphs.
