The following pages link to Effective graph resistance (Q550630):
Displaying 41 items.
- Comparison theorems on resistance distances and Kirchhoff indices of \(S,T\)-isomers (Q401142) (← links)
- Resistance distance-based graph invariants of subdivisions and triangulations of graphs (Q479050) (← links)
- Node and network resistance to bribery in multi-agent systems (Q826846) (← links)
- Sixty years of network reliability (Q1616159) (← links)
- The resistance perturbation distance: a metric for the analysis of dynamic networks (Q1693161) (← links)
- Kirchhoffian indices for weighted digraphs (Q1727734) (← links)
- On generalized windmill graphs (Q1736203) (← links)
- Optimizing network robustness by edge rewiring: a general framework (Q1741288) (← links)
- The impact of the topology on cascading failures in a power grid model (Q1782701) (← links)
- A topological investigation of phase transitions of cascading failures in power grids (Q1783167) (← links)
- On the lower bound of the sum of the algebraic connectivity of a graph and its complement (Q1984518) (← links)
- Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge \(k\)-partiteness (Q2007806) (← links)
- Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum (Q2020461) (← links)
- Kirchhoff index of simplicial networks (Q2040534) (← links)
- Effective resistance is more than distance: Laplacians, simplices and the Schur complement (Q2074965) (← links)
- Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix (Q2093511) (← links)
- Graph coarsening: from scientific computing to machine learning (Q2128866) (← links)
- Generalization of effective conductance centrality for egonetworks (Q2151709) (← links)
- A novel measure of edge and vertex centrality for assessing robustness in complex networks (Q2156532) (← links)
- Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance (Q2172398) (← links)
- Hitting time quasi-metric and its forest representation (Q2174870) (← links)
- On the Kirchhoff index of bipartite graphs with given diameters (Q2192105) (← links)
- Hubs-biased resistance distances on graphs and networks (Q2247702) (← links)
- Resistance distances in Cayley graphs on symmetric groups (Q2357139) (← links)
- Computing an expected hitting time for the 3-urn Ehrenfest model via electric networks (Q2406776) (← links)
- Kemeny's constant and the effective graph resistance (Q2408952) (← links)
- Group inverse of the Laplacian of connections of networks (Q2420419) (← links)
- The Kirchhoff index of subdivisions of graphs (Q2449118) (← links)
- Natural Preconditioning and Iterative Methods for Saddle Point Systems (Q2808242) (← links)
- The correlation of metrics in complex networks with applications in functional brain networks (Q3301229) (← links)
- Monitoring and compartmentalized structures (Q3456511) (← links)
- Resistance distances on networks (Q5034280) (← links)
- Variance and Covariance of Distributions on Graphs (Q5075836) (← links)
- NETWORK COHERENCE ANALYSIS ON A FAMILY OF NESTED WEIGHTED n-POLYGON NETWORKS (Q5082120) (← links)
- Optimization of Stochastic Lossy Transport Networks and Applications to Power Grids (Q5856672) (← links)
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis (Q5874469) (← links)
- (Q5878601) (← links)
- Bounding robustness in complex networks under topological changes through majorization techniques (Q6112392) (← links)
- Controlling the spread of infectious diseases by using random walk method to remove many important links (Q6144148) (← links)
- Graph curvature via resistance distance (Q6204296) (← links)
- Resistance diameters and critical probabilities of Cayley graphs on irreducible complex reflection groups (Q6491168) (← links)
