English

Resistance matrices of balanced directed graphs

Combinatorics 2020-06-04 v3 Functional Analysis

Abstract

Let GG be a strongly connected and balanced directed graph. The Laplacian matrix of GG is then the matrix (not necessarily symmetric) L:=DAL:=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^\dag=[l^{\dag}_{ij}] be the Moore-Penrose inverse of LL. We define the resistance between any two vertices ii and jj of GG by rij:=lii+ljj2lijr_{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 [rij][r_{ij}].

Keywords

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

R2 v1 2026-06-23T09:40:17.083Z