Identifying vital nodes in complex networks based on information entropy, minimum dominating set and distance

DOI10.1142/S0217979221500715zbMath1462.94076OpenAlexW3127873991MaRDI QIDQ4994857

Wei Chen, Pengli Lu

Publication date: 22 June 2021

Published in: International Journal of Modern Physics B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217979221500715

zbMATH Keywords

information entropycomplex networkscentralityminimum dominance setspreading capability

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Dominating communities for hierarchical control of complex networks
• Dominating complex networks by identifying minimum skeletons
• Influential nodes ranking in complex networks: an entropy-based approach
• Identifying influential nodes in complex networks from global perspective
• The centrality index of a graph
• Emergence of Scaling in Random Networks
• Collective dynamics of ‘small-world’ networks
• THE TREATMENT OF TIES IN RANKING PROBLEMS

This page was built for publication: Identifying vital nodes in complex networks based on information entropy, minimum dominating set and distance