Solution to a conjecture on resistance diameter of lexicographic product of paths
From MaRDI portal
Publication:6162033
DOI10.1016/j.dam.2023.04.024zbMath1521.05037WikidataQ123219125 ScholiaQ123219125MaRDI QIDQ6162033
Publication date: 15 June 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Applications of graph theory (05C90) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Resistance distance in complete \(n\)-partite graphs
- 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
- Resistance between two nodes of a ring network
- Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance
- On the resistance diameters of graphs and their line graphs
- Resistance distances in vertex-weighted complete multipartite graphs
- Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs
- Some rules on resistance distance with applications
- Boolean Operations on Graphs.
This page was built for publication: Solution to a conjecture on resistance diameter of lexicographic product of paths
