Resistance values under transformations in regular triangular grids
From MaRDI portal
Publication:6405780
DOI10.1016/J.DAM.2024.05.001arXiv2207.11207OpenAlexW4396823268MaRDI QIDQ6405780FDOQ6405780
Authors: E. J. Evans, Russell Jay Hendel 
Publication date: 22 July 2022
Abstract: In [Evans, Francis 2022; Hendel] the authors investigated resistance distance in triangular grid graphs and observed several types of asymptotic behavior. This paper extends this work by studying the initial, non-asymptotic, behavior found when equivalent circuit transformations are performed, thus reducing the rows in the triangular grid graph one row at a time. The main conjecture characterizes when edge resistance values are less than, equal to, or greater than one after reducing an arbitrary number of times a triangular grid all of whose edge resistances are identically one. A special case of the conjecture is shown. The main theorem identifies patterns of repeating edge labels arising in diagonals of a triangular grid reduced times provided the original grid had at least rows of triangles. This paper also improves upon the notation and concepts introduced by the authors previously, and provides improved proof techniques.
Full work available at URL: https://doi.org/10.1016/j.dam.2024.05.001
Recommendations
- Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph
- The equivalent resistance of a \(3 \times n\) cobweb network and its conjecture of an \(m \times n\) cobweb network
- Some two-vertex resistances of nested triangle network
- Infinite regular electrical networks
- Infinite networks. II: Resistance in an infinite grid
Cited In (1)
This page was built for publication: Resistance values under transformations in regular triangular grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6405780)
