Completeness-resolvable graphs

Min Feng, Xuanlong Ma, Huiling Xu

Given a connected graph $G=(V(G),E(G))$, the length of a shortest path from a vertex $u$ to a vertex $v$ is denoted by $d(u,v)$. For a proper subset $W$ of $V(G)$, let $m(W)$ be t…