Kron Reduction of Graphs With Applications to Electrical Networks
Kron Reduction of Graphs With Applications to Electrical Networks
Consider a weighted undirected graph and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to self-loops. The Kron reduction of this graph is again a graph whose Laplacian matrix is obtained by the Schur complement of the original Laplacian matrix with respect to a specified subset of …