2022/04/18 by Stijn Cambie, Matteo Mazzamurro, Cambie, Stijn +1
Computer Science · Mathematics · #05C35 #68R10 #94A17 #Combinatorics (math.CO) #Computational Drug Discovery Methods #FOS: Mathematics #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2204.08251
openalex publication_date 2022/04/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.