Resistance matrices of balanced directed graphs
Combinatorics
2020-06-04 v3 Functional Analysis
Abstract
Let be a strongly connected and balanced directed graph. The Laplacian matrix of is then the matrix (not necessarily symmetric) , where is the adjacency matrix of and is the diagonal matrix such that the row sums and the column sums of are equal to zero. Let be the Moore-Penrose inverse of . We define the resistance between any two vertices and of by . In this paper, we derive some interesting properties of the resistance and the corresponding resistance matrix .
Cite
@article{arxiv.1906.01165,
title = {Resistance matrices of balanced directed graphs},
author = {Balaji R. and Bapat R. B. and Shivani Goel},
journal= {arXiv preprint arXiv:1906.01165},
year = {2020}
}
Comments
24 pages, 9 figures