Identifying vital nodes in hypernetwork based on local centrality

DOI10.1007/S10878-022-00960-0OpenAlexW4311516843MaRDI QIDQ2108524FDOQ2108524

Authors: Faxu Li, Hui Xu, Liang Wei, Defang Wang 

Publication date: 19 December 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00960-0

Recommendations

• Identifying critical nodes in complex networks based on multi-scale centrality algorithm
• Identifying vital nodes in complex networks based on information entropy, minimum dominating set and distance
• M-centrality: identifying key nodes based on global position and local degree variation
• Identification of node centrality based on Laplacian energy of networks
• Centrality metrics and localization in core-periphery networks
• Identification of Critical Nodes in Large-Scale Spatial Networks

zbMATH Keywords

clustering coefficientdegreehypernetworkvital nodehyper-degreelocal centrality

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• A relational model of data for large shared data banks
• Complete characterization of bicyclic graphs with minimal Kirchhoff index
• Title not available (Why is that?)
• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• Zagreb indices and multiplicative Zagreb indices of Eulerian graphs
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• M-centrality: identifying key nodes based on global position and local degree variation

Cited In (1)

• Retraction note to: ``Identifying vital nodes in hypernetwork based on local centrality

This page was built for publication: Identifying vital nodes in hypernetwork based on local centrality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108524)