Quantcast

On the possible values of the entropy of undirected graphs

Research paper by Maximilien Gadouleau

Indexed on: 11 Nov '17Published on: 09 Nov '17Published in: Journal of Graph Theory



Abstract

The entropy of a digraph is a fundamental measure that relates network coding, information theory, and fixed points of finite dynamical systems. In this article, we focus on the entropy of undirected graphs. We prove any bounded interval only contains finitely many possible values of the entropy of an undirected graph. We also determine all the possible values for the entropy of an undirected graph up to the value of four.