1-REMOVABLE DOMINATING SETS IN GRAPHS
Advances and Applications in Discrete Mathematics · 30.07.2026 · 43 (7) · 899-909
DOI: 10.17654/0974165826055 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, online erschienen am 30.07.2026. Verfasst von Marc Keven C. Cortidor und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
A nonempty subset $S$ of $V(G)$ of a connected nontrivial graph $G$ is a 1-removable dominating set if $S$ is a dominating set of $G$ and for every $v \in S$, $S\setminus \{v\}$ is a dominating set of $G$. The 1-removable domination number of $G$ is the smallest cardinality of a 1-removable dominating set of $G$ denoted by $\gamma^{1r}(G)$. A 1-removable dominating set of $G$ with cardinality equal to $\gamma^{1r}(G)$ is called the $\gamma^{1r}$-set of $G$. This paper defines 1-removable dominating sets in connected nontrivial graphs. It characterizes and determines the bounds of the 1-removable dominating set of the join, corona, and some special graphs. Some exact values of the 1-removable domination number include the cases $\gamma^{1r}(G)=2$ as its lower bound, and $\gamma^{1r}(G)=n$ as its upper bound in the special graphs. On the other hand, $\gamma^{1r}(G + H) \in \{2, 3, 4\}$, and $\gamma^{1r}(K_1 + H) \in \{2, \gamma^{1r}(H)\}$ in the join of graphs while $\gamma^{1r}(G \circ H) = |V(G)| \gamma^{1r}(H)$ in the corona of graphs.
Zitieren
APA
Cortidor, M. K. C., Hinampas, R. G., & Jr. (2026). 1-REMOVABLE DOMINATING SETS IN GRAPHS. Advances and Applications in Discrete Mathematics, 43(7), 899-909. https://doi.org/10.17654/0974165826055
Vancouver
Cortidor MKC, Hinampas RG, Jr.. 1-REMOVABLE DOMINATING SETS IN GRAPHS. Advances and Applications in Discrete Mathematics. 2026;43(7):899-909. doi:10.17654/0974165826055
BibTeX
@article{Cortidor2026,
author = {Cortidor, Marc Keven C. and Hinampas, Renario G. and Jr.},
title = {1-REMOVABLE DOMINATING SETS IN GRAPHS},
journal = {Advances and Applications in Discrete Mathematics},
year = {2026},
volume = {43},
number = {7},
pages = {899--909},
doi = {10.17654/0974165826055}
}
EUVIMED