Resistance distance in graphs and random walks

By José Luis Palacios. 2001

96 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/26855b6e840389b2aad136460beeb86c73f66a78

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. Amin Saberi
2. Arpita Ghosh
3. Stephen P. Boyd
4. Yujun Yang
5. Xiaoyan Jiang
6. Brendan O'Donoghue
7. N. Abreu
8. Steven Diamond

In Discrete Mathematics and Combinatorics

1. Yujun Yang
2. Xiaoyan Jiang

In Geometry and Topology

1. Amin Saberi
2. Xiaoyan Jiang
3. Arpita Ghosh
4. Stephen P. Boyd
5. Yujun Yang
6. N. Abreu

Citations in the corpus

• Minimizing Effective Resistance of a Graph (2008, background): “Some papers on various aspects of resistance distance include [22, 32, 2, 23, 24].”
• Unicyclic graphs with extremal Kirchhoff index (2008, background): “Palacios [19] proved that Kf(G) ≤ 16(n(3) − n) with equality if and only if G is a path.”