Domination Parameters of a Graph and its Complement

• Autorzy: Wyatt J. Desormeaux , Teresa W. Haynes , Michael A. Henning
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

domination; complement; total domination; connected domination; clique domination; restrained domination

Kategorie tematyczne

• 05C69: Dominating sets, independent sets, cliques

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 38
• Numer: 1
• Strony: 203-215

Daty

wydano

2018-02-01

otrzymano

2016-06-02

poprawiono

2016-11-02

zaakceptowano

2016-11-02

online

2017-12-30

Twórcy

autor

Wyatt J. Desormeaux

• , , ,

autor

Teresa W. Haynes

• , , ,
• , , Johnson City, TN USA

autor

Michael A. Henning

• , , ,

Identyfikatory

DOI

10.7151/dmgt.2002