Entropy and the complexity of graphs revisited
From MaRDI portal
Publication:406027
DOI10.3390/e14030559zbMath1331.94041OpenAlexW2059033281MaRDI QIDQ406027
Abbe Mowshowitz, Matthias Dehmer
Publication date: 8 September 2014
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e14030559
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15)
Related Items (12)
Allometric scaling of von Neumann entropy in animal connectomes and its evolutionary aspect ⋮ On measuring the complexity of networks: Kolmogorov complexity versus entropy ⋮ Characterizing complex networks through statistics of Möbius transformations ⋮ Covalent organic frameworks: topological characterizations, spectral patterns and graph entropies ⋮ Depth-based complexity traces of graphs ⋮ Network entropies based on independent sets and matchings ⋮ The evaluation of the number and the entropy of spanning trees on generalized small-world networks ⋮ Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks ⋮ Consistency matters: revisiting the structural complexity for supply chain networks ⋮ Fixation probabilities for simple digraphs ⋮ Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth ⋮ Laplacian spectra for categorical product networks and its applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A history of graph entropy measures
- Information processing in complex networks: Graph entropy and information functionals
- On some counting polynomials in chemistry
- Information theoretic measures of UHG graphs with low computational complexity
- Quantitative methods for ecological network analysis
- An axiomatic approach to network complexity
- Statistical mechanics of complex networks
- Graph complexity and the laplacian matrix in blocked experiments
- 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
This page was built for publication: Entropy and the complexity of graphs revisited