RESTRAINED CONNECTED 2-DOMINATION IN GRAPHS
Far East Journal of Mathematical Sciences (FJMS) · 19.05.2026 · 143 (6) · 1739-1758
DOI: 10.17654/0972087126101 ↗Kurz gefasst
Fachartikel in der Zeitschrift Far East Journal of Mathematical Sciences (FJMS), online erschienen am 19.05.2026. Verfasst von Doli-Jane U. Tejada und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Let $G = (V(G), E(G))$ be a nontrivial connected graph. A set $S\subseteq V(G)$ is restrained connected 2-dominating set of $G$ if every vertex of $V(G)\setminus S$ is (i) dominated by at least two vertices in $S$ and (ii) adjacent to at least one vertex in $V(G)\setminus S$, and the subgraph $\langle S \rangle$ induced by $S$ is connected. The restrained connected 2-domination number of $G$, denoted by $\gamma_{r2c}(G)$, is the minimum cardinality of restrained connected 2-dominating set of $G$. In this paper, we investigate this parameter and establish Nordhaus-Gaddum type inequalities, extremal results with respect to girth and diameter, and a realization theorem. Moreover, we characterize restrained connected 2-dominating sets in the join and corona of graphs and determine their restrained connected 2-domination numbers.
Zitieren
APA
Tejada, D. U., Cabahug, I. S., & Jr. (2026). RESTRAINED CONNECTED 2-DOMINATION IN GRAPHS. Far East Journal of Mathematical Sciences (FJMS), 143(6), 1739-1758. https://doi.org/10.17654/0972087126101
Vancouver
Tejada DU, Cabahug IS, Jr.. RESTRAINED CONNECTED 2-DOMINATION IN GRAPHS. Far East Journal of Mathematical Sciences (FJMS). 2026;143(6):1739-1758. doi:10.17654/0972087126101
BibTeX
@article{Tejada2026,
author = {Tejada, Doli-Jane U. and Cabahug, Isagani S. and Jr.},
title = {RESTRAINED CONNECTED 2-DOMINATION IN GRAPHS},
journal = {Far East Journal of Mathematical Sciences (FJMS)},
year = {2026},
volume = {143},
number = {6},
pages = {1739--1758},
doi = {10.17654/0972087126101}
}
EUVIMED