Login The Centiserver on OMICTools 
Laplacian CentralityDefinition
If G is a graph of n vertices, then the Laplacian centrality with respect to v is:
where N(v) is the set of neighbors of v in G and d_{G}(v_{i}) is the degree of v_{i} in G.
Laplacian centrality is a simple centrality measure that can be calculated in linear time. It is defined as the drop in the Laplacian energy (i.e. sum of squares of the eigenvalues in the Laplacian matrix) of the graph when the vertex is removed. See: Incremental Laplacian Centrality SoftwareReferences
