The Laplacian matrix, , of a weighted digraph is a generalization of the Laplacian (Kirchhoff, admittance) matrix of an ordinary graph. For a weighted digraph whose arc weights belong to [0, 1], the standardized Laplacian matrix ′ is divided by , the number of vertices. We show that the...