Entropy and the complexity of graphs: IV. Entropy measures and graphical structure

DOI10.1007/BF02476673zbMath0204.24603MaRDI QIDQ5602690

Abbe Mowshowitz

Publication date: 1968

Published in: The Bulletin of Mathematical Biophysics (Search for Journal in Brave)

Related Items

Entropy and the complexity of graphs: I. An index of the relative complexity of a graph, Entropy bounds for dendrimers, Entropy of weighted graphs with Randić weights, Degree-based entropies of networks revisited, Information theoretic measures of UHG graphs with low computational complexity, Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions, A history of graph entropy measures, A calculus for measuring the elegance of abstract graphs, Relationships between symmetry-based graph measures, Topological indices and graph entropies for carbon nanotube Y-junctions, Information processing in complex networks: Graph entropy and information functionals, Extremality of degree-based graph entropies, Inequalities for entropy-based measures of network information content, Some bounds of weighted entropies with augmented Zagreb index edge weights, Hosoya entropy of fullerene graphs, CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES, Extremality of graph entropy based on degrees of uniform hypergraphs with few edges, A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS, Classical symmetries and the quantum approximate optimization algorithm

Cites Work

• 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