Resistance distances in composite graphs

DOI10.1088/1751-8113/47/37/375203zbMath1301.05116OpenAlexW2045811688MaRDI QIDQ2922375

Yujun Yang, Douglas J. Klein

Publication date: 10 October 2014

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1751-8113/47/37/375203

zbMATH Keywords

Laplacian spectrumcomposite graphalgebraic connectivityresistance distanceRayleigh's short-cut principle

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (8)

Two-point resistances and random walks on stellated regular graphs ⋮ On the resistance diameter of the Cartesian and lexicographic product of paths ⋮ Some spectral invariants of the neighborhood corona of graphs ⋮ Eigenvalues of the resistance-distance matrix of complete multipartite graphs ⋮ Group inverse of the Laplacian of connections of networks ⋮ Complete characterization of resistance distance for linear octagonal networks ⋮ Resistance distances in the linear polyomino chain ⋮ Resistance distance of blowups of trees

This page was built for publication: Resistance distances in composite graphs