Home > Journals > TAG > Vol. 9 > Iss. 2 (2022)
Article Title
Publication Date
July 2022
Abstract
A set $S$ of vertices is a restrained dominating set of a graph $G=(V,E)$ if every vertex in $V\setminus S$ has a neighbor in $S$ and a neighbor in $V\setminus S$. The minimum cardinality of a restrained dominating set is the restrained domination number $\gamma_{r}(G)$. In this paper we initiate the study of the restrained reinforcement number $r_{r}(G)$ of a graph $G$ defined as the cardinality of a smallest set of edges $F\subseteq E(\overline{G})$ for which $\gamma _{r}(G+F)
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Haghparast, Kazhal; Amjadi, Jafar; Chellali, Mustapha; and Sheikholeslami, Seyed Mahmoud
(2022)
"Restrained reinforcement number in graphs,"
Theory and Applications of Graphs: Vol. 9:
Iss.
2, Article 9.
DOI: 10.20429/tag.2022.090209
Available at:
https://digitalcommons.georgiasouthern.edu/tag/vol9/iss2/9
Supplemental Reference List with DOIs