Laplacian matrix

In the mathematical field of graph theory the Laplacian matrix, sometimes called admittance matrix or Kirchhoff matrix, is a matrix representation of a graph. Together with Kirchhoff's theorem it can be used to calculate the number of spanning trees for a given graph. The Laplacian matrix can be used to find many others properties of the graph, see spectral graph theory.

Definition

Given a graph "G" with "n" vertices (without loops or multiple edges), its Laplacian matrix $L:=(ell\_\{i,j\})\_\{n\; imes\; n\}$ is defined as [Weisstein, Eric W. " [http://mathworld.wolfram.com/LaplacianMatrix.html Laplacian Matrix] ." From MathWorld—A Wolfram Web Resource.]

:

That is, it is the difference of the degree matrix and the adjacency matrix of the graph.In the case of directed graphs, either the indegree or the outdegree might be used, depending on the application.

The normalized laplacian matrix is defined as [Weisstein, Eric W. " [http://mathworld.wolfram.com/LaplacianMatrix.html Laplacian Matrix] ." From MathWorld—A Wolfram Web Resource.]

:

Example

Here is a simple example of a labeled graph and its Laplacian matrix.

Properties

For a graph "G" and its Laplacian matrix "L" with eigenvalues $lambda\_0\; le\; lambda\_1\; le\; cdots\; le\; lambda\_\{n-1\}$:

* "L" is always positive-semidefinite ($forall\; i,\; lambda\_i\; ge\; 0$).
* The number of times 0 appears as an eigenvalue in the Laplacian is the number of connected components in the graph.
* $lambda\_0$ is always 0.
* $lambda\_1$ is called the algebraic connectivity.
* The smallest non-trivial eigenvalue of "L" is called the spectral gap or Fiedler value.

Deformed Laplacian

The deformed Laplacian is commonly defined as

:$Delta(s)=I-sA+s^2(D-I)$

where "I" is the unit matrix, "A" is the adjacency matrix, and "D" is the degree matrix, and "s" is a (complex-valued) number. Note that normal Laplacian is just $Delta(1)$.

As an operator

The Laplacian matrix can be generalized to the case of graphs with an infinite number of vertices and edges; this generalization is known as the discrete Laplace operator.

ee also

*Kirchhoff's theorem

References