Resistance distance local rules
From MaRDI portal
Publication:551944
DOI10.1007/s10910-007-9317-8zbMath1217.05082OpenAlexW2113556799MaRDI QIDQ551944
Publication date: 21 July 2011
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-007-9317-8
Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (18)
Two-point resistances and random walks on stellated regular graphs ⋮ Algorithmic techniques for finding resistance distances on structured graphs ⋮ Random walks and the effective resistance sum rules ⋮ Comparison theorems on resistance distances and Kirchhoff indices of \(S,T\)-isomers ⋮ Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron ⋮ Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs ⋮ On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs ⋮ Two-point resistances in the generalized phenylenes ⋮ Sum of powers of the Laplacian eigenvalues and the Kirchhoff index of a graph ⋮ Complete characterization of resistance distance for linear octagonal networks ⋮ Unnamed Item ⋮ A recursion formula for resistance distances and its applications ⋮ Resistance between two vertices of almost complete bipartite graphs ⋮ Effective resistances and spanning trees in the complete bipartite graph plus a matching ⋮ Resistance distances in the linear polyomino chain ⋮ Resistances between two nodes of a path network ⋮ Some two-point resistances of the Sierpinski gasket network ⋮ Nordhaus-Gaddum-type results for resistance distance-based graph invariants
Cites Work
This page was built for publication: Resistance distance local rules
