Rendon A. Dela Cruz

OUTER-CONNECTED WEAKLY CONNECTED 2 DOMINATION IN GRAPHS

Let $G = (V(G), E(G))$ be a nontrivial connected graph. A subset $S\subseteq V(G)$ is called an outer-connected weakly connected 2-dominating set in $G$ if every vertex $v \in V(G)\setminus S$ is adjacent to at least two vertices in $S$, the subgraph $\langle S \rangle_w$ weakly induced by $S$ is connected, and the ind...