Resistance matrices of graphs with matrix weights

From MaRDI portal



Abstract: The emph{resistance matrix} of a simple connected graph G is denoted by R, and is defined by R=(rij), where rij is the resistance distance between the vertices i and j of G. In this paper, we consider the resistance matrix of weighted graph with edge weights being positive definite matrices of same size. We derive a formula for the determinant and the inverse of the resistance matrix. Then, we establish an interlacing inequality for the eigenvalues of resistance and Laplacian matrices. Using this interlacing inequality, we obtain the inertia of the resistance matrix.












This page was built for publication: Resistance matrices of graphs with matrix weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2419007)