The third Laplacian energy centrality (LC) is an eigenvalue-based method for identifying influential nodes in complex networks, derived from the concept of Laplacian energy [2]. It represents a special case of the \(k\)-th Laplacian energy centrality with \(k = 3\). The centrality \(c_{LC}(i)\) of node \(i\) is defined as
\[
c_{LC}(i) = E^k_L(G) - E^k_L(G_i),
\]
where \(G_i\) denotes the subgraph of \(G\) obtained by removing node \(i\), and \(E^k_L(G)\) is the \(k\)-th Laplacian energy of the network \(G\), given by
\[
E^k_L(G) = \sum_{j=1}^{N} μ_j^k,
\]
where \(μ_1, \dots, μ_N\) are the eigenvalues of the Laplacian matrix of \(G\).
Zhao and Sun [2] demonstrated that the case \(k = 3\) yields superior performance in identifying influential nodes compared with other values of \(k\). The third Laplacian energy centrality is particularly effective for detecting influential spreaders in complex networks and is typically evaluated using the susceptible-infected-recovered (SIR) epidemic model.

References

[1] Shvydun, S. (2025). Zoo of Centralities: Encyclopedia of Node Metrics in Complex Networks. arXiv: 2511.05122 https://doi.org/10.48550/arXiv.2511.05122
[2] Zhao, S., & Sun, S. (2023). Identification of node centrality based on Laplacian energy of networks. Physica A: Statistical Mechanics and its Applications, 609, 128353. doi: 10.1016/j.physa.2022.128353.