Algorithmic techniques for finding resistance distances on structured graphs
From MaRDI portal
Publication:2166256
DOI10.1016/j.dam.2022.04.012zbMath1503.05031arXiv2108.07942OpenAlexW3195315409MaRDI QIDQ2166256
Emily. J. Evans, Amanda E. Francis
Publication date: 24 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.07942
Applications of graph theory (05C90) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effective resistances and Kirchhoff index of ladder graphs
- Comparison theorems on resistance distances and Kirchhoff indices of \(S,T\)-isomers
- An explicit formula for the inverse of a pentadiagonal Toeplitz matrix
- Identities for minors of the Laplacian, resistance and distance matrices
- Resistance distance local rules
- Random walks and the effective resistance sum rules
- Spanning 2-forests and resistance distance in 2-connected graphs
- On the eigenvalues of some tridiagonal matrices
- Resistance distance and the normalized Laplacian spectrum
- On the inverse of a general pentadiagonal matrix
- Resistance distance in wheels and fans
- Some characterizations of symmetric inverse \(M\)-matrices
- Resistance between two vertices of almost complete bipartite graphs
- Resistance distance in straight linear 2-trees
- Enumerative properties of Ferrers graphs
- Effective resistance is more than distance: Laplacians, simplices and the Schur complement
- The On-Line Encyclopedia of Integer Sequences
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
- Resistance distance and spanning 2-forest matrices of linear 2-trees
- Effective resistances and spanning trees in the complete bipartite graph plus a matching
- A recursion formula for resistance distances and its applications
- The maximum corank of graphs with a 2-separation
- Fast link prediction for large networks using spectral embedding
- Resistance distance, Kirchhoff index, and Kemeny's constant in flower graphs
- Minimizing Effective Resistance of a Graph
- A recursive relation for the determinant of a pentadiagonal matrix
- Graphs and matrices
- Graph Sparsification by Effective Resistances
