Resolution of Yan's conjecture on entropy of graphs
Abstract
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 m 2n-3, thus extending and proving a conjecture by Yan.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.