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^{d} a g = [l_{i j}^{d a g}]

be the Moore-Penrose inverse of

L

. We define the resistance between any two vertices

i

and

j

of

G

by

r_{i j} := l_{i i}^{d a g} + l_{j j}^{d a g} - 2 l_{i j}^{d a g}

. In this paper, we derive some interesting properties of the resistance and the corresponding resistance matrix

[r_{i j}]

.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: Resistance matrices of balanced directed graphs