Comment on the paper “Identifying critical nodes in complex networks based on distance Laplacian energy”

Jinping Wang and Shaowei Sun

Chaos, Solitons & Fractals, 2024, vol. 187, issue C

Abstract: Recently, Yin et al. published the article titled “Identifying critical nodes in complex networks based on distance Laplacian energy” in which they proposed a new vertex centrality called distance Laplacian centrality (DLC) to identify critical nodes. However, we find that DLC can only be used in specific networks, which are still connected after removing any individual node. Meanwhile, some incorrect properties were used. Therefore, in this paper, we explain the reason that the property is incorrect and make corrections. In addition, we provide two centrality methods based on two different distance energies to solve the problem caused by disconnected networks.

Keywords: Influential nodes; Complex network; Distance Laplacian energy; Distance variation (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077924008956
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:187:y:2024:i:c:s0960077924008956

DOI: 10.1016/j.chaos.2024.115343

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().