Bounds for degree-based network entropies
From MaRDI portal
Publication:1664287
DOI10.1016/j.amc.2015.06.003zbMath1410.94029OpenAlexW760370425MaRDI QIDQ1664287
Zeng-Qiang Chen, Matthias Dehmer, Yongtang Shi
Publication date: 24 August 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.06.003
Related Items
Resolution of Yan's Conjecture on Entropy of Graphs, On graph entropy measures based on the number of independent sets and matchings, New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks, Network entropies based on independent sets and matchings, Hermitian Laplacian matrix and positive of mixed graphs, Generalized degree-based graph entropies
Cites Work
- Entropy bounds for dendrimers
- An entropy-based uncertainty measurement approach in neighborhood systems
- Extremality of degree-based graph entropies
- Entropy, similarity measure and distance measure of vague soft sets and their relations
- Probabilistic inequalities for evaluating structural network measures
- A history of graph entropy measures
- Degree powers in \(C_5\)-free graphs
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- A computational approach to construct a multivariate complete graph invariant
- Information processing in complex networks: Graph entropy and information functionals
- Inequalities for entropy-based measures of network information content
- Some bounds on entropy measures in information theory
- Degree-based entropies of networks revisited
- A note on distance-based graph entropies
- Degree Powers in Graphs: The Erdős–Stone Theorem
- Graph Energy
- On a conjecture about tricyclic graphs with maximal energy
- On Sets of Acquaintances and Strangers at any Party
- Median eigenvalues of bipartite subcubic graphs
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
