Skip to content

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access 2026

RESILIENT DOMINATION IN GRAPHS

A resilient dominating set in a graph is a dominating set in which each vertex has at least one neighbor within the set and at least one neighbor outside the set, and the weakly induced subgraph of the set is connected. The smallest cardinality of such a set is the resilient domination number. This paper establishes fu...

Carren C. Sibongga, Mae P. Militante, D. J. Tejada et al. · 0 citations
Open access Aug 2026

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...

Kient Rey L. Zuyco, Mae P. Militante, D. J. Tejada et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.