Domination Parameters of a Graph and its Complement
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, includ...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2018-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2002 |