Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
From MaRDI portal
Publication:5552106
DOI10.1007/BF02476692zbMath0165.57602WikidataQ72099665 ScholiaQ72099665MaRDI QIDQ5552106
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 and the complexity of graphs: III. Graphs with prescribed information content, Entropy bounds for dendrimers, Entropy of weighted graphs with Randić weights, Entropy Measures of Distance Matrix, 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, Entropy and the complexity of graphs: IV. Entropy measures and graphical structure, Relations and bounds for the zeros of graph polynomials using vertex orbits, Entropy and the complexity of graphs revisited, 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, The entropy of weighted graphs with atomic bond connectivity edge weights, 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, New network entropy : The domination entropy of 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
Cites Work
