Resistance distance in connected balanced digraphs

DOI10.1016/j.dam.2023.04.014zbMath1516.05048arXiv2201.11405OpenAlexW4372357027MaRDI QIDQ6162026

No author found.

Publication date: 15 June 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Moore-Penrose inverseLaplacian matrixresistance distancestrongly connected balanced digraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• Generalized inverses. Theory and applications.
• Metric and ultrametric inequalities for directed graphs
• A New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties
• A New Notion of Effective Resistance for Directed Graphs—Part II: Computing Resistances
• Resistance distance in directed cactus graphs
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Resistance matrices of balanced directed graphs
• Generalized Inverses of Linear Transformations
• Metric and ultrametric spaces of resistances
• Metric and ultrametric spaces of resistances

This page was built for publication: Resistance distance in connected balanced digraphs