A conjecture of Biggs concerning the resistance of a distance-regular graph
Combinatorics
2010-06-15 v1
Abstract
Previously, Biggs has conjectured that the resistance between any two points on a distance-regular graph of valency greater than 2 is bounded by twice the resistance between adjacent points. We prove this conjecture, give the sharp constant for the inequality, and display the graphs for which the conjecture most nearly fails. Some necessary background material is included, as well as some consequences.
Cite
@article{arxiv.1006.2687,
title = {A conjecture of Biggs concerning the resistance of a distance-regular graph},
author = {Greg Markowsky and Jacobus Koolen},
journal= {arXiv preprint arXiv:1006.2687},
year = {2010}
}