Next Article in Journal
Benefit-Cost Analysis of Security Systems for Multiple Protected Assets Based on Information Entropy
Previous Article in Journal
Curvature Entropy for Curved Profile Generation
Article Menu

Export Article

Open AccessArticle
Entropy 2012, 14(3), 559-570;

Entropy and the Complexity of Graphs Revisited

Department of Computer Science, The City College of New York (CUNY), 138th Street at ConventAvenue, New York, NY 10031, USA
Institute for Bioinformatics and Translational Research, UMIT, Eduard Wallnoefer Zentrum 1, 6060, Hall in Tyrol, Austria
Authors to whom correspondence should be addressed.
Received: 16 January 2012 / Revised: 5 March 2012 / Accepted: 12 March 2012 / Published: 14 March 2012
Full-Text   |   PDF [133 KB, uploaded 24 February 2015]   |  


This paper presents a taxonomy and overview of approaches to the measurement of graph and network complexity. The taxonomy distinguishes between deterministic (e.g., Kolmogorov complexity) and probabilistic approaches with a view to placing entropy-based probabilistic measurement in context. Entropy-based measurement is the main focus of the paper. Relationships between the different entropy functions used to measure complexity are examined; and intrinsic (e.g., classical measures) and extrinsic (e.g., Körner entropy) variants of entropy-based models are discussed in some detail. View Full-Text
Keywords: complex networks; Shannon entropy; graph entropy complex networks; Shannon entropy; graph entropy

Figure 1

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

Mowshowitz, A.; Dehmer, M. Entropy and the Complexity of Graphs Revisited. Entropy 2012, 14, 559-570.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top