Inequalities for entropy-based measures of network information content
type: Item
instance of: scholarly article
title: Inequalities for entropy-based measures of network information content
zbMATH Open document ID: 1220.05125
author: Matthias Dehmer
author: Abbe Mowshowitz
published in: Applied Mathematics and Computation
publication date: 2010-03-31T00:00:00Z
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5688905
zbMATH Keywords: graphs
zbMATH Keywords: entropy
zbMATH Keywords: structural information content
zbMATH Keywords: inequalities
zbMATH Keywords: information theory
MaRDI profile type: Publication
full work available at URL: j.amc.2009.12.051
OpenAlex ID: W1978381807
cites work: Information processing in complex networks: Graph entropy and information functionals
cites work: Information theoretic measures of UHG graphs with low computational complexity
cites work: ROBUSTNESS IN SCALE-FREE NETWORKS: COMPARING DIRECTED AND UNDIRECTED NETWORKS
cites work: Entropy, orbits, and spectra of graphs
cites work: Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
cites work: Information theoretical analysis of ecological networks
cites work: Q4134011
cites work: Q4142699
cites work: Q4198056
cites work: Q4840778
cites work: Q5485943
cites work: On Graph Complexity
cites work: Q4692391
cites work: Q3992521
cites work: Parallel concepts in graph theory
cites work: Q3818360
cites work: Elements of Information Theory
cites work: Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
cites work: Entropy and the complexity of graphs: III. Graphs with prescribed information content
cites work: Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
cites work: Q5432687
cites work: Some bounds on entropy measures in information theory
DOI: 10.1016/J.AMC.2009.12.051
description: scientific article; zbMATH DE number 5688905