Constructive characterizations concerning total outer-independent domination in subdivision trees

A. Cabrera-Martínez, J. L. López-Carmona, A. Serrano-Díaz

Let $G$ be a nontrivial connected graph with vertex set $V(G)$. A set of vertices $D\subseteq V(G)$ is called a total outer-independent dominating set of $G$ if every vertex of $G$…