2 problems

Let $G$ be the straight linear $k$-tree with $k\geq 1$ and $n$ vertices, and let $H$ be the straight linear $k$-tree with $n+1$ vertices. Let $r_G$ and $r_H$ denote resistance dist…

Let $G_n$ be the straight linear $k$-tree with vertex set $\{1,2,\ldots,n\}$ and edges between vertices whose labels differ by at most $k$. Similar asymptotic behavior should hold…