Certified domination
Imagine that we are given a set of officials and a set of civils. For each civil , there must be an official that can serve , and whenever any such is serving , there must also be another civil that observes , that is, may act as a kind of witness, to avoid any abuse from . What is the minimum numbe...
Main Authors: | Magda Dettlaff, Magdalena Lemańska, Jerzy Topp, Radosław Ziemann, Paweł Żyliński |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2020-01-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.09.004 |
Similar Items
-
Graphs with equal domination and certified domination numbers
by: Magda Dettlaff, et al.
Published: (2019-01-01) -
Bounds on weak and strong total domination in graphs
by: M.H. Akhbari, et al.
Published: (2016-04-01) -
Characterizations in Domination Theory
by: Plummer, Andrew Robert
Published: (2006) -
Various Bounds for Liar’s Domination Number
by: Alimadadi Abdollah, et al.
Published: (2016-08-01) -
An improved Nordhaus–Gaddum-Type Theorem for 2-Rainbow Independent Domination Number
by: Enqiang Zhu
Published: (2021-02-01)