Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
From MaRDI portal
Cites work
Cited in
(19)- Degree-based entropies of networks revisited
- Some bounds of weighted entropies with augmented Zagreb index edge weights
- Hosoya entropy of fullerene graphs
- Classical symmetries and the quantum approximate optimization algorithm
- Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions
- Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
- Information theoretic measures of UHG graphs with low computational complexity
- A calculus for measuring the elegance of abstract graphs
- Entropy bounds for dendrimers
- Entropy of weighted graphs with Randić weights
- CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES
- A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS
- Extremality of degree-based graph entropies
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Relationships between symmetry-based graph measures
- Topological indices and graph entropies for carbon nanotube Y-junctions
- A history of graph entropy measures
- Information processing in complex networks: Graph entropy and information functionals
- Inequalities for entropy-based measures of network information content
This page was built for publication: Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5602690)
