Resistance-distance matrix: A computational algorithm and its application

By D. Babić, Douglas J. Klein, I. Lukovits, S. Nikolic, Nenad Trinajstic. 2002

149 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Organic Chemistry

View Paper: https://www.semanticscholar.org/paper/12a001beaec0059479eaec551b4502b732516d29

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Yujun Yang
2. Douglas J. Klein
3. Xiaoyan Jiang

In Geometry and Topology

1. Xiaoyan Jiang
2. Yujun Yang
3. Douglas J. Klein

In Organic Chemistry

1. Xiaoyan Jiang
2. Yujun Yang

Citations in the corpus

• Centrality measure in graphs (2010, background): “[ 67 ]. If one is interested only in the centrality of one or a few edges, then the process of computing �( �u −� ev) & � 2 (� eu −� ev) (as needed for the associated ρ� & c� values—�x being the vector of 0s except for a single 1 in the xth position) is just an O(n 2 ) process.”
• Circuit Theory and Model-Based Inference for Landscape Connectivity (2013, unknown): “…− ej ) is invariant to the choice of generalized inverse Q− of the Laplacian matrix Q. (Proof in Appendix A.) This invariance was not noted by Klein and Randić (1993), though various generalized inverses have been used to compute the resistance distance (e.g., Babić et al. 2002; McRae 2006).”
• Unicyclic graphs with extremal Kirchhoff index (2008, methodology): “Much work has been done to compute Kirchhoff index of some classes of graphs [20, 21, 22, 23, 24, 25, 26].”
• ISOLATION BY RESISTANCE (2006, unknown): “Other algorithms (e.g., Babic et al. 2002; Vast et al. 2005) allow computation of all resistance distances with a single matrix inversion and may be more efficient for moderate-sized networks with large numbers of pairwise resistances to calculate.”