A conjecture of Biggs concerning the resistance of a distance-regular graph
From MaRDI portal
Publication:976737
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.
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 electric resistances for distance-regular graphs
- On the Cheeger constant for distance-regular graphs
- scientific article; zbMATH DE number 1047714 (Why is no real title available?)
- A collection of results concerning electric resistance and simple random walk on distance-regular graphs
- The generalized distance spectrum of a graph and applications
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)
