Resistance between two nodes of a ring clique network
From MaRDI portal
Publication:6046489
DOI10.1007/s00034-021-01859-7zbMath1509.94181OpenAlexW3202053396MaRDI QIDQ6046489
Publication date: 11 May 2023
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-021-01859-7
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resistance distance in complete \(n\)-partite graphs
- Chromatic roots of a ring of four cliques
- Random walks and the effective resistance sum rules
- Resistance distances in the linear polyomino chain
- Resistance distance and the normalized Laplacian spectrum
- Resistance between two vertices of almost complete bipartite graphs
- Some two-point resistances of the Sierpinski gasket network
- Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
- Resistance distance in potting networks
- On the resistance diameter of hypercubes
- Some two-vertex resistances of nested triangle network
- On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain
- Resistance between two nodes of a ring network
- Computation of resistance distance and Kirchhoff index of the two classes of silicate networks
- Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph
- Resistance distances in vertex-weighted complete multipartite graphs
- Theory of resistor networks: the two-point resistance
- Graph Spectra for Complex Networks
- Two-point resistances and random walks on stellated regular graphs
- Calculating two-point resistances in distance-regular resistor networks
