Degree matrix

From Wikipedia, the free encyclopedia

In the mathematical field of graph theory the degree matrix is a diagonal matrix which contains information about the degree of each vertex. It is used together with the adjacency matrix to construct the Laplacian matrix of a graph.

[edit] Definition

Given a graph G = (V,E) with \|V\|=n the degree matrix D for G is a n \times n square matrix defined as

d_{i,j}:=\left\{ \begin{matrix} \deg(v_i) & \mbox{if}\ i = j \\ 0 & \mbox{otherwise} \end{matrix} \right.


[edit] Example

Vertex labeled graph Degree matrix
\begin{pmatrix} 4 & 0 & 0 & 0 & 0 & 0\\ 0 & 3 & 0 & 0 & 0 & 0\\ 0 & 0 & 2 & 0 & 0 & 0\\ 0 & 0 & 0 & 3 & 0 & 0\\ 0 & 0 & 0 & 0 & 3 & 0\\ 0 & 0 & 0 & 0 & 0 & 1\\ \end{pmatrix}

For an undirected graph, the degree of a vertex is the number of edges incident to the vertex. This means that each loop is counted twice. This is because each edge has two endpoints and each endpoint adds to the degree.