Complexity in chemistry, biology and ecology.
From MaRDI portal
Publication:5485943
Recommendations
Cited in
(21)- Graphs with minimum degree-entropy
- Entropy and the complexity of graphs revisited
- A hybrid binomial inverse hypergeometric probability distribution: theory and applications
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- A history of graph entropy measures
- A novel design approach of a nonlinear resistor based on a memristor emulator
- Inequalities for entropy-based measures of network information content
- The braid index of polyhedral links
- Large-scale analysis of structural branching measures
- The complexity of Platonic and Archimedean polyhedral links
- Depth-based complexity traces of graphs
- A dream that has come true: chaos from a nonlinear circuit with a real memristor
- Relations and bounds for the zeros of graph polynomials using vertex orbits
- Topological reversibility and causality in feed-forward networks
- On measuring the complexity of networks: Kolmogorov complexity versus entropy
- Advances in network complexity
- Complexity in chemistry. Introduction and fundamentals.
- Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
- On graph entropy measures based on the number of independent sets and matchings
- A note on distance-based entropy of dendrimers
- The effect of graph operations on the degree-based entropy
This page was built for publication: Complexity in chemistry, biology and ecology.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485943)
