Return the normalized Laplacian matrix of G.
The normalized graph Laplacian is the matrix
where is the graph Laplacian and is the diagonal matrix of node degrees.
Parameters : | G : graph
nodelist : list, optional
weight : string or None, optional (default=’weight’)
|
---|---|
Returns : | L : NumPy matrix
|
See also
Notes
For MultiGraph/MultiDiGraph, the edges weights are summed. See to_numpy_matrix for other options.
If the Graph contains selfloops, D is defined as diag(sum(A,1)), where A is the adjencency matrix [R295].
References
[R294] | Fan Chung-Graham, Spectral Graph Theory, CBMS Regional Conference Series in Mathematics, Number 92, 1997. |
[R295] | (1, 2) Steve Butler, Interlacing For Weighted Graphs Using The Normalized Laplacian, Electronic Journal of Linear Algebra, Volume 16, pp. 90-98, March 2007. |