Resistance distance in directed cactus graphs

Abstract: Let

G = (V, E)

be a strongly connected and balanced digraph with vertex set

V = 1, d o t s c, n

. The classical distance

d_{i j}

between any two vertices

i

and

j

in

G

is the minimum length of all the directed paths joining

i

and

j

. The resistance distance (or, simply the resistance) between any two vertices

i

and

j

in

V

is defined by

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

, where

l_{p q}^{d a g g e r}

is the

(p, q)^{m t h}

entry of the Moore-Penrose inverse of

L

which is the Laplacian matrix of

G

. In practice, the resistance

r_{i j}

is more significant than the classical distance. One reason for this is, numerical examples show that the resistance distance between

i

and

j

is always less than or equal to the classical distance, i.e.

r_{i j} l e q d_{i j}

. However, no proof for this inequality is known. In this paper, we show that this inequality holds for all directed cactus graphs.

Full work available at URL: https://arxiv.org/abs/1911.05951

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

Cites Work

Cited In (10)

This page was built for publication: Resistance distance in directed cactus graphs