資料結構

Let matrices A and D represent the Adjacency and Degree matrices of an undirected graph ($n$ vertices, $m$ edges) with no self-loops. Let B be an oriented incidence matrix of the same undirected graph. What is the relationship of A, B, and D. (D is the diagonal matrix of vertex degree ($n \times n$), where the entries $d_{i,i}$ is the degree of vertex $i$, the number of edges incident to it.)