A conjecture of Biggs concerning the resistance of a distance-regular graph

Publication date 16 June 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.2687, https://eudml.org/doc/231616, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r78.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Distance in graphs (05C12) Association schemes, strongly regular graphs (05E30)

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.

Review text

Summary: \textit{N.L. Biggs} [``Potential theory on distance-regular graphs, Comb. Probab. Comput. 2, No.\,3, 243--255 (1993; Zbl 0793.04007)] 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

Cited in

(5)

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)