A conjecture of Biggs concerning the resistance of a distance-regular graph
classification
🧮 math.CO
keywords
conjectureresistancebiggsdistance-regulargraphpointssomeadjacent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.