Extremal entropy for graphs with given size
Combinatorics
2022-05-09 v2
Abstract
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.
Cite
@article{arxiv.2204.08251,
title = {Extremal entropy for graphs with given size},
author = {Stijn Cambie and Matteo Mazzamurro},
journal= {arXiv preprint arXiv:2204.08251},
year = {2022}
}
Comments
8 pages, 2 figures