加载中…
Barret, Evans, and Francis conjectured that if is the straight linear 3-tree with vertices and is the straight linear 3-tree with vertices then where and are the resistance distance between vertices and in graphs and 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 -th term.

生成讲解博客的中文版本

生成AI智能校验的中文版本