In graph theory, a degree matrix is a diagonal matrix that contains information about the degree of each vertex in a graph, with diagonal entries representing the degree of the corresponding vertex. It is essential in spectral graph theory and is used in conjunction with the adjacency matrix to study the properties of graphs, such as connectivity and clustering.