A lower bound on graph entropy

DOI10.3318/PRIA.2018.118.03MaRDI QIDQ5376429zbMATH OpenOpenAlexFDO

Authors G. Boreland

Publication date 17 September 2018

Published in Mathematical Proceedings of the Royal Irish Academy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3318/pria.2018.118.03

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On extremal properties of graph entropies
• scientific article; zbMATH DE number 7410277
• scientific article; zbMATH DE number 780788
• New upper bound and lower bound for degree-based network entropy
• On the distance based graph entropies

Cited in

(6)

• Information theoretic parameters of noncommutative graphs and convex corners
• Lower bounds for transition probabilities on graphs
• Information theoretic measures of UHG graphs with low computational complexity
• An Entropy-Based Proof for the Moore Bound for Irregular Graphs
• Graph Operations Decreasing Values of Degree-Based Graph Entropies
• Lower and upper bounds on graph communicabilities

This page was built for publication: A lower bound on graph entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376429)