Search
Abstract
Imagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce the concept of certified domination that models the aforementioned problem. Specifically, a dominating set D of a graph G = (VG, EG) is said to be certified if every vertex in D has either zero or at least two neighbours in VG \ D. The cardinality of a minimum certified dominating set in G is called the certified domination number of G. Herein, we present the exact values of the certified domination number for some classes of graphs as well as provide some upper bounds on this parameter for arbitrary graphs. We then characterise a wide class of graphs with equal domination and certified domination numbers and characterise graphs with large values of certified domination numbers. Next, we examine the effects on the certified domination number when the graph is modified by deleting/adding an edge or a vertex. We also provide Nordhaus–Gaddum type inequalities for the certified domination number.
Citations
-
8
CrossRef
-
0
Web of Science
-
1 1
Scopus
Authors (5)
-
Jerzy Topp
-
Radosław Ziemann
-
Paweł Żyliński
Cite as
Full text
- Publication version
- Accepted or Published Version
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
AKCE International Journal of Graphs and Combinatorics
no. 17,
pages 86 - 97,
ISSN: 0972-8600 - Language:
- English
- Publication year:
- 2020
- Bibliographic description:
- Dettlaff M., Lemańska M., Topp J., Ziemann R., Żyliński P.: Certified domination// AKCE International Journal of Graphs and Combinatorics -Vol. 17,iss. 1 (2020), s.86-97
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.akcej.2018.09.004
- Verified by:
- Gdańsk University of Technology
seen 153 times
Recommended for you
Graphs with equal domination and certified domination numbers
- M. Dettlaff,
- M. Lemańska,
- J. Topp
- + 3 authors