Comment on the paper "Identifying critical nodes in complex networks based on distance Laplacian energy".

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 (D L C) to identify critical nodes. However, we find that D L C 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. • We find some errors in the main results of the paper (ID: 114487). • We make correction on the main theorem. • We provide two centrality methods based on two different distance energies. [ABSTRACT FROM AUTHOR]