On the resistance diameter of the Cartesian and lexicographic product of paths

DOI10.1007/s12190-021-01587-wzbMath1486.05076OpenAlexW3181624001MaRDI QIDQ2142551

Si-Ao Xu, Xiang-Feng Pan, Yun-xiang Li, Hong-Bo Hua

Publication date: 27 May 2022

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-021-01587-w

zbMATH Keywords

Cartesian productresistance distancelexicographic productresistance diameterorderable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (2)

Computation of resistance distance with Kirchhoff index of body centered cubic structure ⋮ Solution to a conjecture on resistance diameter of lexicographic product of paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks and electrical resistances in products of graphs
• Graph multiplication
• Resistance distance and the normalized Laplacian spectrum
• On the resistance diameter of hypercubes
• Computation of resistance distance and Kirchhoff index of the two classes of silicate networks
• Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph
• Resistance distances in composite graphs
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Recursive calculation of effective resistances in distance-regular networks based on Bose–Mesner algebra and Christoffel–Darboux identity
• Boolean Operations on Graphs.

This page was built for publication: On the resistance diameter of the Cartesian and lexicographic product of paths