On resistance matrices of weighted balanced digraphs

Abstract

Let $G$ be a connected graph with $V(G)=\{1,\dots ,n\}$. Then the resistance distance between any two vertices $i$ and $j$ is given by $r_{ij}:=l_{ii}^{†}+l_{jj}^{†}-2l_{ij}^{†}$, where $l_{ij}^{†}$ is the $(i,j{)}^{\mathrm{th}}$ entry of the Moore-Penrose inverse of the Laplacian matrix of $G$. For the resistance matrix $R:=[r_{ij}]$, there is an elegant formula to compute the inverse of $R$. This says that \[R^{-1}=-\frac{1}{2}L + \frac{1}{τ' R τ} ττ', \] where \[τ:=(τ_1,\dotsc,τ_n)'~~\mbox{and}~~ τ_{i}:=2- \sum_{\{j \in V(G):(i,j) \in E(G)\}} r_{ij}~~~i=1,\dotsc,n. \] A far reaching generalization of this result that gives an inverse formula for a generalized resistance matrix of a strongly connected and matrix weighted balanced directed graph is obtained in this paper. When the weights are scalars, it is shown that the generalized resistance is a non-negative real number. We also obtain a perturbation result involving resistance matrices of connected graphs and Laplacians of digraphs.