Domination Parameters of a Graph and its Complement

Desormeaux Wyatt J.; Haynes Teresa W.; Henning Michael A.

doi:10.7151/dmgt.2002

Discussiones Mathematicae Graph Theory (Feb 2018)

Domination Parameters of a Graph and its Complement

Desormeaux Wyatt J.,
Haynes Teresa W.,
Henning Michael A.

Affiliations

Desormeaux Wyatt J.: Department of Mathematics, Department of Pure and Applied Mathematics, University of Johannesburg, Auckland Park, 2006South Africa
Haynes Teresa W.: Department of Mathematics, Department of Pure and Applied Mathematics, University of Johannesburg, Auckland Park, 2006South Africa
Henning Michael A.: Department of Mathematics, Department of Pure and Applied Mathematics, University of Johannesburg, Auckland Park, 2006South Africa

DOI: https://doi.org/10.7151/dmgt.2002
Journal volume & issue: Vol. 38, no. 1
pp. 203 – 215

Abstract

Read online

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.

Published in Discussiones Mathematicae Graph Theory

ISSN: 1234-3099 (Print); 2083-5892 (Online)
Publisher: University of Zielona Góra
Country of publisher: Poland
LCC subjects: Science: Mathematics
Website: https://www.dmgt.uz.zgora.pl/

About the journal

Abstract

Keywords