Effective graph resistance (Q550630): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower bounds for covering times for reversible Markov chains and random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-negative matrices and Markov chains. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank one perturbation and its application to the laplacian spectrum of a graph<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with given diameter maximizing the spectral radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3066830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with given diameter maximizing the algebraic connectivity / rank
 
Normal rank

Latest revision as of 06:16, 4 July 2024

scientific article
Language Label Description Also known as
English
Effective graph resistance
scientific article

    Statements

    Effective graph resistance (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 July 2011
    0 references
    effective resistance
    0 references
    optimisation
    0 references
    Laplacian eigenvalues
    0 references
    graph spectrum
    0 references
    network robustness
    0 references

    Identifiers

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