Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: clique domination

Sortuj według:

Ogranicz wyniki do:

Domination Parameters of a Graph and its Complement

100%

Desormeaux W. J., Haynes T. W., Henning M. A.

Discussiones Mathematicae Graph Theory

2017

tom 38

nr 1

203-215

A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Desormeaux W. J.

1 Haynes T. W.

1 Henning M. A.

1 2018

Wyniki wyszukiwania

Domination Parameters of a Graph and its Complement