Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2207.11207

Resistance values under transformations in regular triangular grids

Emily J. Evans·Russell J. Hendel
View original source ↗Read source document ↗Export metadata ↓

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 their work by studying the initial, non-asymptotic, behavior found when equivalent circuit transformations are performed, reducing the rows in the triangular grid graph one row at a time. The main conjecture characterizes, after reducing an arbitrary number of times an initial triangular grid all of whose edge resistances are identically one, when edge resistance values are less than, equal to, or greater than one. A special case of the conjecture is proven. The main theorem identifies patterns of repeating edge resistances arising in diagonals of a triangular grid reduced $s$ times provided the original grid has at least $4s$ rows of triangles. This paper also improves upon the notation, concepts, and proof techniques introduced by the authors previously.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emily J. Evans, Russell J. Hendel. 2024-06-23. Resistance values under transformations in regular triangular grids. https://doi.org/10.1016/j.dam.2024.05.001

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗