Resistance between two vertices of almost complete bipartite graphs
type: Item
instance of: scholarly article
title: Resistance between two vertices of almost complete bipartite graphs
zbMATH Open document ID: 1441.94118
author: Luzh Ye
author: Weigen Yan
published in: Discrete Applied Mathematics
publication date: 2019-03-11T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 7034230
zbMATH Keywords: resistance
zbMATH Keywords: almost complete bipartite graph
zbMATH Keywords: Foster's theorem
MaRDI profile type: Publication
full work available at URL: j.dam.2018.08.030
OpenAlex ID: W2898232098
cites work: Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
cites work: Resistance distance local rules
cites work: Q3706275
cites work: The exact evaluation of the corner-to-corner resistance of anM×Nresistor network: asymptotic expansion
cites work: Q5800730
cites work: Resistance distance in complete \(n\)-partite graphs
cites work: The two-point resistance of a resistor network: a new formulation and application to the cobweb network
cites work: Calculating two-point resistances in distance-regular resistor networks
cites work: Resistance between two nodes of a ring network
cites work: Q3285875
cites work: Random walks and the effective resistance of networks
cites work: An Extension of Foster's Network Theorem
cites work: Theory of resistor networks: the two-point resistance
cites work: A recursion formula for resistance distances and its applications
Wikidata QID: Q129012441
DOI: 10.1016/J.DAM.2018.08.030
description: scientific article; zbMATH DE number 7034230