Metric and ultrametric spaces of resistances (Q5893969): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Encyclopedia of Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric and ultrametric spaces of resistances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions of existence and uniqueness of a solution of problems of convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank

Latest revision as of 12:05, 3 July 2024

scientific article; zbMATH DE number 5819491
Language Label Description Also known as
English
Metric and ultrametric spaces of resistances
scientific article; zbMATH DE number 5819491

    Statements

    Metric and ultrametric spaces of resistances (English)
    0 references
    25 November 2010
    0 references
    In 1987, \textit{A. D. Gvishiani} and \textit{V. A Gurvich} [``Metric and ultrametric spaces of resistances'', Russ. Math. Surv. 42, No. 6, 235--236 (1987); translation from Usp. Mat. Nauk 42, No. 6, 187--188 (1987; Zbl 0708.90028)] briefly reported results that established conditions under which effective resistances in an undirected graph satisfy a triangle inequality, and the stronger condition that they form an ultrametric space. Since that time, various specializations of their results have been obtained independently. This paper reports much more fully on the Gvishiani-Gurvich results, in addition providing natural interpretations of the metric spaces from effective Ohm resistance, shortest path, width of a bottleneck path, and maximum flow, as specific instances of their general framework.
    0 references
    metric space
    0 references
    ultrametric space
    0 references
    shortest path
    0 references
    bottleneck path
    0 references
    maximum flow
    0 references
    Ohm's law
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references