This research proves a conjecture on maximal resistance distance in linear 3-trees, suggesting a specific limit as vertices increase.
Barret, Evans, and Francis conjectured that if G is the straight linear 3-tree with n vertices and H is the straight linear 3-tree with $n+1$ vertices then \[limn→ ∞ rH (1, n+1) - r_G(1,n) = 1/14,\] where rG(u,v) and rH(u,v) are the resistance distance between vertices u and v in graphs G and H respectively. In this paper, we prove the conjecture by looking at the determinants of deleted Laplacian matrices. The proof uses a Laplace expansion method on a family of determinants to determine the underlying recursion this family satisfies and then uses routine linear algebra methods to obtain an exact Binet formula for the n-th term.
No takes yet. Share an insight, caveat, or question.
Evans et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: