Pseudoinverse of the Laplacian and best spreader node in a network.

A new graph metric is proposed that complements the effective graph resistance R_{G} and that specifies the heterogeneity of the nodal spreading capacity in a graph and the pseudoinverse matrix of the Laplacian of star, path, and cycle graphs.