# Resistance matrices of balanced directed graphs

## TL;DR

This paper explores the properties of resistance matrices in strongly connected balanced directed graphs, extending concepts from undirected graph theory to directed graphs with applications in network analysis.

## Contribution

It introduces the resistance matrix for balanced directed graphs and derives new properties, expanding the understanding of graph resistance beyond undirected cases.

## Key findings

- Resistance matrix properties are characterized for balanced directed graphs.
- New relationships between resistance and graph structure are established.
- The resistance matrix provides insights into network connectivity and robustness.

## 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^\dag=[l^{\dag}_{ij}]$ be the Moore-Penrose inverse of $L$. We define the resistance between any two vertices $i$ and $j$ of $G$ by $r_{ij}:=l^{\dag}_{ii}+l^{\dag}_{jj}-2l^{\dag}_{ij}$. In this paper, we derive some interesting properties of the resistance and the corresponding resistance matrix $[r_{ij}]$.