Metric and ultrametric spaces of resistances

Discrete Applied Mathematics

Volumn 158, Issue 14, 2010, Pages 1496-1505

  Gurvich, Vladimir ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Joule Lenz heat; Maximum flow; Maxwell principle; Metric and ultrametric spaces; Ohm law; Shortest and bottleneck paths

Indexed keywords

BOTTLENECK PATHS; ELECTRICAL CIRCUIT; MAXIMUM FLOWS; OHM LAW; OHM'S LAW; PER UNIT; POTENTIAL DIFFERENCE; RESISTANCE DISTANCE; SHORTEST PATH; STRICTLY POSITIVE REAL; TRIANGLE INEQUALITY; ULTRAMETRIC SPACE;

GRAPH THEORY; MAXWELL EQUATIONS;

SURVEYS;

EID: 77953962664     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.05.007     Document Type: Article

References (21)

1. Babić D., Klein D.J., Lukovits I., Nikolić S., and Trinajstić N. Resistance-distance matrix: a computational algorithm and its applications. Int. J. Quantum Chem. 90 (2002) 166-176
2. E. Boros, K. Elbassioni, Gurvich, K. Makino, A pumping algorithm for ergodic mean payoff stochastic games with perfect information, RUTCOR Research Reports, RRR-19-2009 and RRR-05-2010, Rutgers University, in: Proceedings of the 14th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2010, Lausanne, Switzerland, 9-11 June 2010, in: Lecture Notes in Computer Science (in press).
3. Deza M., and Deza E. Encyclopedia of Distances (2009), Springer-Verlag
4. Gomory R.E., and Hu T.C. Multi-terminal network flows. J. SIAM 9 4 (1961) 551-570
5. Gurvich V.A. Metric and ultrametric spaces of resistances. Mat. Prosveschenie (Enlightment) (2009) 134-141 (in Russian)
6. Gvishiani A.D., and Gurvich V.A. Metric and ultrametric spaces of resistances. Communications of the Moscow Mathematical Society. Russian Math. Surveys 42 6 (258) (1987) 235-236
7. Gvishiani A.D., and Gurvich V.A. Conditions of existence and uniqueness of a solution of problems of convex programming. Russian Math. Surveys 45 4 (1990) 173-174
8. Gvishiani A.D., and Gurvich V.A. Dynamical Classification Problems and Convex Programming in Applications (1992), Nauka (Science), Moscow (in Russian)
9. Hu T.C. Integer Programming and Network Flows (1969), Addison-Wesley, Reading, MA 452 p.
10. Klein D.J. Resistance-distance sum rules. Croat. Chem. Acta 75 (2002) 633-649
11. Klein D.J., Palacios J.L.L., Randić M., and Trinajstić N. Random walks and chemical graph theory. J. Chem. Inf. Comput. Sci. 44 5 (2004) 1521-1525
12. Klein D.J., and Randić M.J. Resistance distance. J. Math. Chem. 12 (1993) 81-95
13. Lukovits L., Nikolić S., and Trinajstić N. Resistance distance in regular graphs. Int. J. Quantum Chem. 71 (1999) 217-225
14. Lukovits L., Nikolić S., and Trinajstić N. Note on the resistance distances in the dodecahedron. Croat. Chem. Acta 73 (2000) 957-967
15. Lyashko O.V. Why resistance does not decrease?. Kvant 1 (1985) 10-15 (in Russian). English translation in Quant. Selecta, Algebra and Analysis II, S. Tabachnikov (Ed.), AMS, Math. World, 15 (1999) 63-72
16. Minty G.J. Monotone networks. Proc. R. Soc. Lond. Ser. A 257 (1960) 194-212
17. Palacios J.L.L. Closed-form formulas for Kirchhoff index. Int. J. Quantum Chem. 81 (2001) 135-140
18. Rockafellar R.T. Convex Analysis (1970), Princeton University Press 470 p.
19. Wikipedia, Resistance Distance, at http://en.wikipedia.org/wiki/Resistance_distance.
20. WolframMathWorld, Resistance Distance, at http://mathworld.wolfram.com/ResistanceDistance.
21. Xiao W., and Gutman I. Resistance distance and Laplacian spectrum. Theor. Chem. Acc. 110 (2003) 284-289