Related papers: Resistance between two nodes in general position o…
An m x n cobweb network consists of n radial lines emanating from a center and connected by $m$ concentric n-sided polygons. A conjecture of Tan, Zhou and Yang for the resistance from center to perimeter of the cobweb is proved by extending…
The problem of the two-point resistance in various networks has recently received considerable attention. Here we consider the problem on a fan-resistor network, which is a segment of the cobweb network. Using a recently developed approach,…
We consider the problem of two-point resistance in a resistor network previously studied by one of us [F. Y. Wu, J. Phys. A {\bf 37}, 6653 (2004)]. By formulating the problem differently, we obtain a new expression for the two-point…
We consider the problem of two point resistance on an $m times n$ cobweb network with a 2r boundary which has never been solved before. Past efforts prior to 2014 researchers just only solved the cases with free boundary or null resistor…
We consider the problem of two-point resistance on an m x n cobweb network with a superconducting boundary, which is topologically equivalent to a geographic globe. We deduce a concise formula for the resistance between any two nodes on the…
We obtain a general formula for the resistance distance (or effective resistance) between any pair of nodes in a general family of graphs which we call flower graphs. Flower graphs are obtained from identifying nodes of multiple copies of a…
The resistance between arbitrary two nodes in a resistor network is obtained in terms of the eigenvalues and eigenfunctions of the Laplacian matrix associated with the network. Explicit formulas for two-point resistances are deduced for…
The resistance between two nodes in some resistor networks has been studied extensively by mathematicians and physicists. Let $L_n$ be a linear hexagonal chain with $n$\, 6-cycles. Then identifying the opposite lateral edges of $L_n$ in…
Considerable progress has recently been made in the development of techniques to exactly determine two-point resistances in networks of various topologies. In particular, two types of method have emerged. One is based on potentials and the…
An explicit formula for the resistance between two nodes in a network with a non-symmetric Laplacian matrix L is obtained. This is of great advantage e.g. in electronic circuit fault analysis, where non-linear systems have to be solved…
$n$-circuits are series-parallel networks composed of exactly $n$ unit resistors. This paper is focused on evaluating the mean resistance of all $n$-circuits, $M_n$, establishing that it lies between $1$ and $4.3954$ for all $n$. We…
The effective resistance between a pair of nodes in a weighted undirected graph is defined as the potential difference induced between them when a unit current is injected at the first node and extracted at the second node, treating edge…
In Refs.[1] and [2], calculation of effective resistances on distance-regular networks was investigated, where in the first paper, the calculation was based on the stratification of the network and Stieltjes function associated with the…
We measure resistively the mean-field superconducting-normal phase boundaries of both kagome and honeycomb wire networks immersed in a transverse magnetic field. In addition to their agreement with theory about the overall shapes of phase…
In this work, we present novel general analytical solutions for the currents that are developed in the edges of network-like circuits when some nodes of the network act as sources/sinks of DC or AC current. We assume that Ohm's law is valid…
An algorithm for the calculation of the resistance between two arbitrary nodes in an arbitrary distance-regular resistor network is provided, where the calculation is based on stratification introduced in \cite{js} and Stieltjes transform…
Simplifications of a result from a prior paper concerning the electric resistance between points in a distance-regular graph are given. In particular, we prove that the maximal resistance between points is bounded by twice the resistance…
The two- and all-terminal reliabilities of the Brecht-Colbourn ladder and the generalized fan have been calculated exactly for arbitrary size as well as arbitrary individual edge and node reliabilities, using transfer matrices of dimension…
We present a formulation of the determination of the impedance between any two nodes in an impedance network. An impedance network is described by its Laplacian matrix L which has generally complex matrix elements. We show that by solving…
Any graph can be considered as a network of resistors, each of which has a resistance of $1 \Omega.$ The resistance distance $r_{ij}$ between a pair of vertices $i$ and $j$ in a graph is defined as the effective resistance between $i$ and…