Degree-based entropies of networks revisited
From MaRDI portal
Publication:1643281
DOI10.1016/j.amc.2015.03.046zbMath1410.94027OpenAlexW2014936988MaRDI QIDQ1643281
Publication date: 19 June 2018
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.03.046
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Measures of information, entropy (94A17)
Related Items
Entropy of weighted graphs with Randić weights, Resolution of Yan's Conjecture on Entropy of Graphs, An information dimension of weighted complex networks, Bounds for degree-based network entropies, On graph entropy measures based on the number of independent sets and matchings, On topological properties of degree-based entropy of hex-derived network of type 3, Covalent organic frameworks: topological characterizations, spectral patterns and graph entropies, An improved data fusion method based on weighted belief entropy considering the negation of basic probability assignment, Digraphs with large maximum Wiener index, Network entropies based on independent sets and matchings, Some bounds of weighted entropies with augmented Zagreb index edge weights, Nordhaus-Gaddum type results for graph irregularities, Hosoya entropy of fullerene graphs, Generalized degree-based graph entropies
Cites Work
- Extremality of degree-based graph entropies
- A history of graph entropy measures
- Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- On a relation between the Randić index and the chromatic number
- Degree powers in \(C_5\)-free graphs
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- Structural information content of networks: graph entropy based on local vertex functionals
- Information processing in complex networks: Graph entropy and information functionals
- Some bounds on entropy measures in information theory
- Degree powers in graphs with forbidden subgraphs
- Advances in Network Complexity
- Degree Powers in Graphs: The Erdős–Stone Theorem
- Graph Energy
- On a conjecture about tricyclic graphs with maximal energy
- Randi\'c index, diameter and the average distance
- The Maximal Matching Energy of Tricyclic Graphs
- Elements of Information Theory
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
