laplacian
Graph Laplacian matrix
Syntax
Description
returns the graph Laplacian matrix, L
= laplacian(G
)L
. Each diagonal entry,
L(j,j)
, is given by the degree of node j
,
degree(G,j)
. The off-diagonal entries of L
represent the edges in G
such that L(i,j) = L(j,i) =
-1
if there is an edge between nodes i
and
j
; otherwise, L(i,j) = L(j,i) = 0
. The
input graph G
cannot be a multigraph or contain self-loops, and
edge weights are ignored.
Examples
Input Arguments
Output Arguments
Extended Capabilities
Version History
Introduced in R2015b