  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.
