Information theoretic measures of UHG graphs with low computational complexity

DOI10.1016/j.amc.2007.02.095zbMath1123.68088OpenAlexW1999377847MaRDI QIDQ2383930

Matthias Dehmer, Frank Emmert-Streib

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.02.095

zbMATH Keywords

entropyinformation theorygraph classesgraph measureshierarchical graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Measures of information, entropy (94A17)

Related Items (8)

Entropy bounds for dendrimers ⋮ Entropy and the complexity of graphs revisited ⋮ A history of graph entropy measures ⋮ Amoeba Techniques for Shape and Texture Analysis ⋮ Information processing in complex networks: Graph entropy and information functionals ⋮ Inequalities for entropy-based measures of network information content ⋮ Some bounds of weighted entropies with augmented Zagreb index edge weights ⋮ Structural similarity of directed universal hierarchical graphs: a low computational complexity approach

Uses Software

• Graphviz
• Dynagraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the graph isomorphism counting problem
• Graph drawing software
• Graph Classes: A Survey
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
• Entropy and the complexity of graphs: III. Graphs with prescribed information content
• Entropy and the complexity of graphs: IV. Entropy measures and graphical structure

This page was built for publication: Information theoretic measures of UHG graphs with low computational complexity