Simplified results on the regularity of electric resistance on a distance-regular graph
Jacobus Koolen, Greg Markowsky

TL;DR
This paper simplifies previous results on electric resistance in distance-regular graphs, establishing bounds on resistance between points and providing easier proofs under weaker conditions.
Contribution
It offers simplified proofs and bounds for electric resistance in distance-regular graphs, improving understanding of their resistance properties.
Findings
Max resistance between points is at most twice the resistance between neighbors
Simplified proof techniques are introduced for resistance bounds
Results extend previous work with more accessible proofs
Abstract
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 between neighbors. We also show that if the constant is weakened, then a very simple proof can be given.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Graph theory and applications · Limits and Structures in Graph Theory
