A recursion formula for resistance distances and its applications
From MaRDI portal
Publication:2444563
DOI10.1016/J.DAM.2012.07.015zbMATH Open1285.05050OpenAlexW2065882671MaRDI QIDQ2444563FDOQ2444563
Authors: Yujun Yang, Douglas J. Klein 
Publication date: 10 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.07.015
Cites Work
- The matrix-forest theorem and measuring relations in small social groups
- Some rules on resistance distance with applications
- Resistance matrix and \(q\)-Laplacian of a unicyclic graph
- Title not available (Why is that?)
- Resistance distances and the Kirchhoff index in Cayley graphs
- Potential Theory on Distance-Regular Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Identities for minors of the Laplacian, resistance and distance matrices
- Title not available (Why is that?)
- Metric and ultrametric spaces of resistances
- Resistance distance and the normalized Laplacian spectrum
- Resistance distance in wheels and fans
- Title not available (Why is that?)
- Kirchhoff indexes of a network
- Title not available (Why is that?)
- Recursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity
- Metric and ultrametric spaces of resistances
- Title not available (Why is that?)
- The electrical resistance of a graph captures its commute and cover times
- Inequalities and equalities associated with the Campbell-Youla generalized inverse of the indefinite admittance matrix of resistive networks
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- The forest metrics of a graph and their properties
- Title not available (Why is that?)
- Resistance distance local rules
- Evaluation of effective resistances in pseudo-distance-regular resistor networks
Cited In (50)
- Resistance distance and Kirchhoff index in generalized R-vertex and R-edge corona for graphs
- The \(\{1\}\)-inverse of the Laplacian of subdivision-vertex and subdivision-edge coronae with applications
- Resistance distances and the Kirchhoff index in double graphs
- Further results on resistance distance and Kirchhoff index in electric networks
- Comparison theorems on resistance distances and Kirchhoff indices of \(S,T\)-isomers
- Title not available (Why is that?)
- On degree resistance distance of cacti
- Resistance between two vertices of almost complete bipartite graphs
- Resistance distance-based graph invariants of subdivisions and triangulations of graphs
- Title not available (Why is that?)
- Efficient Point-to-Point Resistance Distance Queries in Large Graphs
- Resistance distances on networks
- Laplacian matrix of a weighted graph with new pendant vertices
- Two-point resistances and random walks on stellated regular graphs
- Resistances between two nodes of a path network
- Extremal graphs with diameter 2 for two indices on resistance-distance
- On a new cyclicity measure of graphs -- the global cyclicity index
- Calculation of resistances for multiply connected domains using Schwarz-Christoffel transformations
- Resistance distances in corona and neighborhood corona networks based on Laplacian generalized inverse approach
- On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs
- On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain
- Two-point resistances in sailboat fractal networks
- Complete characterization of bicyclic graphs with minimal Kirchhoff index
- On constructing rational spanning tree edge densities
- Refinement of metrics: Erdős number, a case study
- Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
- Resistance distances and Kirchhoff index of graphs with an involution
- The degree resistance distance of cacti
- Resistance distance and Kirchhoff index of \(R\)-vertex join and \(R\)-edge join of two graphs
- Some spectral invariants of the neighborhood corona of graphs
- Algorithmic techniques for finding resistance distances on structured graphs
- Golden section, Fibonacci sequence and the time invariant Kalman and Lainiotis filters
- Some results on resistance distances and resistance matrices
- Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron
- Spanning 2-forests and resistance distance in 2-connected graphs
- Edge-disjoint spanning trees and forests of graphs
- Generalized characteristic polynomials of join graphs and their applications
- On the resistance diameter of hypercubes
- Resistance distance in generalized core-satellite graphs
- Resistance distance and Kirchhoff index of unbalanced blowups of graphs
- Two-point resistances in a family of self-similar \((x, y)\)-flower networks
- The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
- Resistance distance in straight linear 2-trees
- Some two-point resistances of the Sierpinski gasket network
- Computation of resistance distance with Kirchhoff index of body centered cubic structure
- On relation between Kirchhoff index, Laplacian-energy-like invariant and Laplacian energy of graphs
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- Two-point resistances in the generalized phenylenes
- The basic principle of m × n resistor networks
- Ordering connected graphs by their Kirchhoff indices
This page was built for publication: A recursion formula for resistance distances and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444563)
