Paired Disjunctive Domination on R-Corona Operations

This paper explores the newly introduced concept of paired disjunctive domination, initially proposed by Henning et al. A subset $$ D \subseteq V $$ is called a disjunctive dominating set of a graph $$ G $$ for each vertex $$ v \in V $$ , if there exists either a vertex in $$ D $$ adjacent to $$ v $$ , or at least two vertices in $$ D $$ whose distance from $$ v $$ is exactly two in $$ G $$ . Additionally, a disjunctive dominating set $$ D \subseteq V $$ is defined as a paired disjunctive dominating set if the induced subgraph by $$ D $$ in $$ G $$ contains a perfect matching. In this work, we present new results concerning the R-vertex, R-edge, R-vertex neighborhood, and R-edge neighborhood corona structures based on this parameter.