Pages that link to "Item:Q5552105"
From MaRDI portal
The following pages link to Entropy and the complexity of graphs: I. An index of the relative complexity of a graph (Q5552105):
Displaying 50 items.
- Entropy bounds for dendrimers (Q279580) (← links)
- Entropy of weighted graphs with Randić weights (Q296334) (← links)
- The Hosoya entropy of a graph (Q296523) (← links)
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469) (← links)
- Entropy and the complexity of graphs revisited (Q406027) (← links)
- Large-scale analysis of structural branching measures (Q460865) (← links)
- Extremality of degree-based graph entropies (Q506695) (← links)
- Probabilistic inequalities for evaluating structural network measures (Q508736) (← links)
- A history of graph entropy measures (Q621629) (← links)
- On the distance based graph entropies (Q668715) (← links)
- Quantitative graph theory: a new branch of graph theory and network science (Q780939) (← links)
- Depth-based complexity traces of graphs (Q898379) (← links)
- A computational approach to construct a multivariate complete graph invariant (Q903598) (← links)
- Structural information content of networks: graph entropy based on local vertex functionals (Q936078) (← links)
- Information processing in complex networks: Graph entropy and information functionals (Q945216) (← links)
- Inequalities for entropy-based measures of network information content (Q961624) (← links)
- On the complexity of graphs and molecules (Q1053645) (← links)
- Branching in graphs and molecules (Q1095945) (← links)
- Novel inequalities for generalized graph entropies -- graph energies and topological indices (Q1636867) (← links)
- Degree-based entropies of networks revisited (Q1643281) (← links)
- Bounds for degree-based network entropies (Q1664287) (← links)
- On measuring the complexity of networks: Kolmogorov complexity versus entropy (Q1687410) (← links)
- The entropy of weighted graphs with atomic bond connectivity edge weights (Q1727279) (← links)
- Network entropies based on independent sets and matchings (Q1736140) (← links)
- Some bounds of weighted entropies with augmented Zagreb index edge weights (Q2004176) (← links)
- Hosoya entropy of fullerene graphs (Q2010674) (← links)
- New network entropy : The domination entropy of graphs (Q2059882) (← links)
- Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
- Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions (Q2154479) (← links)
- Novel results on partial Hosoya polynomials: an application in chemistry (Q2161874) (← links)
- Relations and bounds for the zeros of graph polynomials using vertex orbits (Q2180690) (← links)
- On the degeneracy of the Randić entropy and related graph measures (Q2224838) (← links)
- \(\lambda\)-core distance partitions (Q2229456) (← links)
- Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs (Q2286143) (← links)
- Extremality of graph entropy based on degrees of uniform hypergraphs with few edges (Q2311742) (← links)
- Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth (Q2333222) (← links)
- Generalized degree-based graph entropies (Q2333475) (← links)
- Information theoretic measures of UHG graphs with low computational complexity (Q2383930) (← links)
- Depth-based hypergraph complexity traces from directed line graphs (Q2416965) (← links)
- A calculus for measuring the elegance of abstract graphs (Q2422969) (← links)
- Polyhedral graphs via their automorphism groups (Q2423027) (← links)
- On graph entropy measures based on the number of independent sets and matchings (Q2660906) (← links)
- An axiomatic approach to network complexity (Q2731526) (← links)
- CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES (Q3393530) (← links)
- Measures of the restrictiveness of project networks (Q4142985) (← links)
- A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS (Q4981789) (← links)
- Complexity of subdivision-vertex and subdivision-edge join graphs (Q5043938) (← links)
- Resolution of Yan's Conjecture on Entropy of Graphs (Q5050774) (← links)
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs (Q5552106) (← links)
- Entropy and the complexity of graphs: III. Graphs with prescribed information content (Q5552107) (← links)
