On Convexity in Split graphs: Complexity of Steiner tree and Domination

A Mohanapriya, P Renjith, N Sadagopan

Given a graph $G$ with a terminal set $R\subseteq V(G)$, the Steiner tree problem (STREE) asks for a set $S\subseteq V(G)\setminus R$ such that the graph induced on $S\cup R$ is…