Optimal Resistor Networks
From MaRDI portal
Publication:6402268
arXiv2206.08095MaRDI QIDQ6402268FDOQ6402268
Authors: J. Robert Johnson, Mark Walters 
Publication date: 16 June 2022
Abstract: Given a graph on n vertices with m edges, each of unit resistance, how small can the average resistance between pairs of vertices be? There are two very plausible extremal constructions -- graphs like a star, and graphs which are close to regular -- with the transition between them occuring when the average degree is 3. However, one of our main aims in this paper is to show that there are significantly better constructions for a range of average degree including average degree near 3. A key idea is to link this question to a analogous question about rooted graphs -- namely `which rooted graph minimises the average resistance to the root?'. The rooted case is much simpler to analyse than the unrooted, and one of the main results of this paper is that the two cases are asymptotically equivalent.
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05)
This page was built for publication: Optimal Resistor Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402268)
