Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Degree matrix
open-in-new
<p>In the <a href="/facts/Mathematics/pxTouaz4">mathematical</a> field of <a href="/facts/Algebraic_graph_theory/5HNDPx8g">algebraic graph theory</a>, the degree matrix of an <a href="/facts/Undirected_graph/kw3eIBUe">undirected graph</a> is a <a href="/facts/Diagonal_matrix/tjIAHrE6">diagonal matrix</a> which contains information about the <a href="/facts/Degree_(graph_theory)/LnFFpI8v">degree</a> of each <a href="/facts/Vertex_(graph_theory)/WhlWmL3o">vertex</a>—that is, the number of edges attached to each vertex. It is used together with the <a href="/facts/Adjacency_matrix/jYXNhYGs">adjacency matrix</a> to construct the <a href="/facts/Laplacian_matrix/Iwea2mm9">Laplacian matrix</a> of a graph: the Laplacian matrix is the difference of the degree matrix and the adjacency matrix. </p>