Resistance between two vertices of almost complete bipartite graphs
From MaRDI portal
Publication:1730251
DOI10.1016/j.dam.2018.08.030zbMath1441.94118OpenAlexW2898232098WikidataQ129012441 ScholiaQ129012441MaRDI QIDQ1730251
Publication date: 11 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.08.030
Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12)
Related Items
A type of generalized mesh-star transformation and applications in electrical networks ⋮ Algorithmic techniques for finding resistance distances on structured graphs ⋮ Resistance between two nodes of a ring clique network ⋮ Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs ⋮ Resistance distance of generalized wheel and dumbbell graph using symmetric {1}-inverse of Laplacian matrix ⋮ Complete characterization of resistance distance for linear octagonal networks ⋮ Effective resistances and spanning trees in the complete bipartite graph plus a matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resistance distance in complete \(n\)-partite graphs
- Resistance distance local rules
- Random walks and the effective resistance of networks
- Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
- Resistance between two nodes of a ring network
- A recursion formula for resistance distances and its applications
- Theory of resistor networks: the two-point resistance
- An Extension of Foster's Network Theorem
- Calculating two-point resistances in distance-regular resistor networks
- The two-point resistance of a resistor network: a new formulation and application to the cobweb network
- The exact evaluation of the corner-to-corner resistance of anM×Nresistor network: asymptotic expansion
