A conjecture of Biggs concerning the resistance of a distance-regular graph
From MaRDI portal
Publication:976737
zbMATH Open1225.05256arXiv1006.2687MaRDI QIDQ976737FDOQ976737
Authors: Greg Markowsky, Jack H. Koolen 
Publication date: 16 June 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1006.2687
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- On electric resistances for distance-regular graphs
- Resistance distance in complete \(n\)-partite graphs
- A bound for the diameter of distance-regular graphs
- scientific article; zbMATH DE number 4106886
- scientific article; zbMATH DE number 47845
- scientific article; zbMATH DE number 6739955
- On resistance of graphs
- On bounding the diameter of a distance-regular graph
- On the resistance diameters of graphs and their line graphs
- Nordhaus-Gaddum-type results for resistance distance-based graph invariants
Cited In (5)
- On the Cheeger constant for distance-regular graphs
- The generalized distance spectrum of a graph and applications
- On electric resistances for distance-regular graphs
- Title not available (Why is that?)
- A collection of results concerning electric resistance and simple random walk on distance-regular graphs
This page was built for publication: A conjecture of Biggs concerning the resistance of a distance-regular graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976737)
