Steiner distance matrix of caterpillar graphs

Ali Azimi, R. B. Bapat, Shivani Goel

For a connected graph $G:=(V,E)$, the Steiner distance $d_G(X)$ among a set of vertices $X$ is the minimum size among all the connected subgraphs of $G$ whose vertex set contains $…