Laplacian matrix

From Wikipedia, the free encyclopedia

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 other properties of the graph, see spectral graph theory.

Contents 1 Definition 2 Example 3 Properties 4 Deformed Laplacian 5 As an operator 6 See also 7 References

[edit] Definition

Given a graph G with n vertices (without loops or multiple edges), its Laplacian matrix is defined as^[1]

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^[1]

[edit] Example

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

Labeled graph	Laplacian matrix

[edit] Properties

For a graph G and its Laplacian matrix L with eigenvalues :

• L is always positive-semidefinite ().
• The number of times 0 appears as an eigenvalue in the Laplacian is the number of connected components in the graph.
• λ₀ is always 0.
• λ₁ is called the algebraic connectivity.
• The smallest non-trivial eigenvalue of L is called the spectral gap or Fiedler value.

[edit] Deformed Laplacian

The deformed Laplacian is commonly defined as

Δ(s) = I − sA + s²(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 Δ(1).

[edit] 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.

[edit] See also

• Kirchhoff's theorem

[edit] References