Resistance matrices of balanced directed graphs
Abstract
Let G be a strongly connected and balanced directed graph. The Laplacian matrix of G is then the matrix (not necessarily symmetric) L:=D-A, where A is the adjacency matrix of G and D is the diagonal matrix such that the row sums and the column sums of L are equal to zero. Let L=[lij] be the Moore-Penrose inverse of L. We define the resistance between any two vertices i and j of G by rij:=lii+ljj-2lij. In this paper, we derive some interesting properties of the resistance and the corresponding resistance matrix [rij].
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.