I. Introduction
This paper considers undirected graphs with a weight associated with each one of its edges. The edge-weights are symmetric positive definite matrices. For such graphs we introduce the concept of “effective resistances.” The effective resistance of a node is defined to be a square matrix block that appears in the diagonal of the inverse of the matrix-weighted Dirichlet graph Laplacian matrix (cf. Section II). The terminology “effective resistance” is motivated by the fact that these matrices also define a linear map from currents to voltages in a generalized electrical network that can be constructed from the undirected matrix-weighted graph. However, the voltages, currents, and resistances in this generalized electrical network take matrix values [1].