On the degeneracy of the Randić entropy and related graph measures

DOI10.1016/j.ins.2018.11.011zbMath1453.68132MaRDI QIDQ2224838

Yongtang Shi, Frank Emmert-Streib, Shailesh Tripathi, Abbe Mowshowitz, Herbert Jodlbauer, Matthias Dehmer, Cheng-yi Xia, Zeng-Qiang Chen

Publication date: 4 February 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.11.011

zbMATH Keywords

networks; graphs; data science; quantitative graph theory; structural graph measures; structural network analysis

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

94A17: Measures of information, entropy

Related Items

The effect of graph operations on the degree-based entropy

Uses Software

• CPOLY

Cites Work

• Entropy of weighted graphs with Randić weights
• An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
• Zeros of polynomials with random coefficients
• Extremality of degree-based graph entropies
• Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
• A computational approach to construct a multivariate complete graph invariant
• Information processing in complex networks: Graph entropy and information functionals
• On Randić energy
• On the distribution of roots of polynomials
• Graph Energy
• On the Number of Real Roots of a Random Algebraic Equation
• Collective dynamics of ‘small-world’ networks
• On Some Applications of Information Indices in Chemical Graph Theory
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• A Generalization of a Theorem of Bôcher
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item