Solution to a conjecture on resistance diameter of lexicographic product of paths

DOI10.1016/J.DAM.2023.04.024zbMATH Open1521.05037WikidataQ123219125 ScholiaQ123219125MaRDI QIDQ6162033FDOQ6162033

Authors: Wensheng Sun, Yujun Yang 

Publication date: 15 June 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Recommendations

• On the resistance diameter of the Cartesian and lexicographic product of paths
• Resistance distances in composite graphs
• On the resistance diameters of graphs and their line graphs
• On some resolving partitions for the lexicographic product of two graphs
• Random walks and electrical resistances in products of graphs
• The metric dimension of the lexicographic product of graphs
• The metric dimension of the lexicographic product of graphs
• Resistance distance in complete \(n\)-partite graphs
• Algorithmic techniques for finding resistance distances on structured graphs
• On the resistance diameter of hypercubes

zbMATH Keywords

resistance distancelexicographic productresistance diameterprinciple of substitution

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• On the resistance diameters of graphs and their line graphs
• Resistance distance in complete \(n\)-partite graphs
• Some rules on resistance distance with applications
• Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs
• Boolean Operations on Graphs.
• Resistance distances in vertex-weighted complete multipartite graphs
• Resistance between two nodes of a ring network
• On the resistance diameter of hypercubes
• On the Kirchhoff index of a graph and the matchings of the subdivision
• On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain
• On the resistance diameter of the Cartesian and lexicographic product of paths
• Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance

Cited In (2)

• Resistance distance in tensor and strong product of path or cycle graphs based on the generalized inverse approach
• A method for constructing graphs with the same resistance spectrum

This page was built for publication: Solution to a conjecture on resistance diameter of lexicographic product of paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6162033)