Resistance matrices of balanced directed graphs

preprint2019arXivOpen access

Abstract

Let GG be a strongly connected and balanced directed graph. The Laplacian matrix of GG is then the matrix (not necessarily symmetric) L:=D−AL:=D-A, where AA is the adjacency matrix of GG and DD is the diagonal matrix such that the row sums and the column sums of LL are equal to zero. Let L†=[lij†]L^†=[l^†_{ij}] be the Moore-Penrose inverse of LL. We define the resistance between any two vertices ii and jj of GG by rij:=lii†+ljj†−2lij†r_{ij}:=l^†_{ii}+l^†_{jj}-2l^†_{ij}. In this paper, we derive some interesting properties of the resistance and the corresponding resistance matrix [rij][r_{ij}].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.