On the possible values of the entropy of undirected graphs

Gadouleau, Maximilien

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.

Citation

Gadouleau, M. (2018). On the possible values of the entropy of undirected graphs. Journal of Graph Theory, 88(2), 302-311. https://doi.org/10.1002/jgt.22213

• Journal Article Type: Article
• Acceptance Date: Oct 17, 2017
• Online Publication Date: Nov 9, 2017
• Publication Date: 2018-06
• Deposit Date: Aug 7, 2018
• Journal: Journal of Graph Theory
• Print ISSN: 0364-9024
• Electronic ISSN: 1097-0118
• Publisher: Wiley
• Peer Reviewed: Peer Reviewed
• Volume: 88
• Issue: 2
• Pages: 302-311
• DOI: https://doi.org/10.1002/jgt.22213
• Public URL: https://durham-repository.worktribe.com/output/1324410