- Tytuł:
- Restrained Domination in Self-Complementary Graphs
- Autorzy:
-
Desormeaux, Wyatt J.
Haynes, Teresa W.
Henning, Michael A. - Powiązania:
- https://bibliotekanauki.pl/articles/32083901.pdf
- Data publikacji:
- 2021-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
domination
complement
restrained domination
self-complementary graph - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2021, 41, 2; 633-645
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł