Entropy and the complexity of graphs: I. An index of the relative complexity of a graph

From MaRDI portal
Publication:5552105

DOI10.1007/BF02476948zbMath0165.57601WikidataQ53022858 ScholiaQ53022858MaRDI QIDQ5552105

Abbe Mowshowitz

Publication date: 1968

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




Related Items (53)

Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphsEntropy and the complexity of graphs: III. Graphs with prescribed information contentEntropy bounds for dendrimersComplexity of subdivision-vertex and subdivision-edge join graphsEntropy of weighted graphs with Randić weightsThe Hosoya entropy of a graphResolution of Yan's Conjecture on Entropy of GraphsNovel inequalities for generalized graph entropies -- graph energies and topological indicesBranching in graphs and moleculesDegree-based entropies of networks revisitedInformation theoretic measures of UHG graphs with low computational complexityComputational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctionsEntropy and the complexity of graphs: IV. Entropy measures and graphical structureNovel results on partial Hosoya polynomials: an application in chemistryAn efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariantsBounds for degree-based network entropiesOn graph entropy measures based on the number of independent sets and matchingsRelations and bounds for the zeros of graph polynomials using vertex orbitsDepth-based hypergraph complexity traces from directed line graphsOn measuring the complexity of networks: Kolmogorov complexity versus entropyEntropy and the complexity of graphs revisitedA history of graph entropy measuresA calculus for measuring the elegance of abstract graphsPolyhedral graphs via their automorphism groupsDepth-based complexity traces of graphsRelationships between symmetry-based graph measuresTopological indices and graph entropies for carbon nanotube Y-junctionsA computational approach to construct a multivariate complete graph invariantLarge-scale analysis of structural branching measuresThe entropy of weighted graphs with atomic bond connectivity edge weightsOn the degeneracy of the Randić entropy and related graph measures\(\lambda\)-core distance partitionsStructural information content of networks: graph entropy based on local vertex functionalsNetwork entropies based on independent sets and matchingsOn the distance based graph entropiesAn axiomatic approach to network complexityInformation processing in complex networks: Graph entropy and information functionalsExtremality of degree-based graph entropiesProbabilistic inequalities for evaluating structural network measuresInequalities for entropy-based measures of network information contentSome bounds of weighted entropies with augmented Zagreb index edge weightsHosoya entropy of fullerene graphsMeasures of the restrictiveness of project networksGraph entropy based on the number of spanning forests of \(c\)-cyclic graphsNew network entropy : The domination entropy of graphsCHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIESExtremality of graph entropy based on degrees of uniform hypergraphs with few edgesA NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKSQuantitative graph theory: a new branch of graph theory and network scienceComputing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidthGeneralized degree-based graph entropiesOn the complexity of graphs and moleculesClassical symmetries and the quantum approximate optimization algorithm



Cites Work


This page was built for publication: Entropy and the complexity of graphs: I. An index of the relative complexity of a graph