A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS

DOI10.1080/01969720802435925zbMath1290.94022OpenAlexW2058293325MaRDI QIDQ4981789

Matthias Dehmer

Publication date: 25 June 2014

Published in: Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01969720802435925

zbMATH Keywords

entropygraphstopological entropystructural informationstructural information content

Mathematics Subject Classification ID

Information theory (general) (94A15) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

A history of graph entropy measures ⋮ Information processing in complex networks: Graph entropy and information functionals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Entropy splitting for antiblocking corners and perfect graphs
• Topological mappings between graphs, trees and generalized trees
• Elements of Information Theory
• 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: A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS