Back to Search
Start Over
RESTRAINED DOMINATION IN SELF-COMPLEMENTARY GRAPHS.
- Source :
-
Discussiones Mathematicae: Graph Theory . 2021, Vol. 41 Issue 2, p633-645. 13p. - Publication Year :
- 2021
-
Abstract
- A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V (G) \ S is adjacent to a vertex in S and to a vertex in V (G) \ S. The restrained domination number of a graph G is the minimum cardinality of a restrained dominating set of G. In this paper, we study restrained domination in self-complementary graphs. In particular, we characterize the self-complementary graphs having equal domination and restrained domination numbers. [ABSTRACT FROM AUTHOR]
- Subjects :
- *DOMINATING set
Subjects
Details
- Language :
- English
- ISSN :
- 12343099
- Volume :
- 41
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Discussiones Mathematicae: Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 148220958
- Full Text :
- https://doi.org/10.7151/dmgt.2222