2 problems

Let $G$ be a 2-tree, that is, a graph obtained from a triangle by repeatedly adding a new vertex adjacent to both endpoints of an existing edge. Let $\mu_{\operatorname{int}}(G)$ d…

Let $G$ be a linear 2-tree, and let its diameter tend to infinity. Let the maximal resistance distance of $G$ mean the maximum of $r_G(u,v)$ over pairs of vertices. Unbounded resis…