On group inverses of \(M\)-matrices with uniform diagonal entries (Q1124948): Difference between revisions

Properties of group inverses of \(M\)-matrices (arising in resistive electrical network theory) possessing uniform (constant) diagonals are considered. If \({\mathcal G}\) is an undirected graph on \(n\)-vertices which has a cutpoint then the group inverse of its Laplacian cannot have a uniform diagonal. This includes the case when \({\mathcal G}\) is a tree. The situation of a simple graph without cutpoints, i.e. an \(n\)-cycle, is then studied. The mean free passage matrix \(M\) of certain doubly stochastic matrices is investigated. Numerical examples, including a graph which is a weighted path on 6 vertices, then graphs on \(n\)-vertices extending to graphs on \((n+1)\) vertices, and the case of an irreducible doubly stochastic matrix, are calculated.