Simple expressions for the long walk distance
From MaRDI portal
Abstract: The walk distances in graphs are defined as the result of appropriate transformations of the proximity measures, where is the weighted adjacency matrix of a connected weighted graph and is a sufficiently small positive parameter. The walk distances are graph-geodetic, moreover, they converge to the shortest path distance and to the so-called long walk distance as the parameter approaches its limiting values. In this paper, simple expressions for the long walk distance are obtained. They involve the generalized inverse, minors, and inverses of submatrices of the symmetric irreducible singular M-matrix where is the Perron root of
Recommendations
Cites work
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- A new status index derived from sociometric analysis
- scientific article; zbMATH DE number 5784227 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3373921 (Why is no real title available?)
- Identities for minors of the Laplacian, resistance and distance matrices
- Inequalities and equalities associated with the Campbell-Youla generalized inverse of the indefinite admittance matrix of resistive networks
- Limits and the Index of a Square Matrix
- The graph bottleneck identity
- The walk distances in graphs
This page was built for publication: Simple expressions for the long walk distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389550)