Wyniki wyszukiwania dla: CERTIFIED DOMINATION

• Certified domination

  Publikacja

  • M. Dettlaff
  • M. Lemańska
  • J. Topp
  • R. Ziemann
  • P. Żyliński

  - AKCE International Journal of Graphs and Combinatorics - Rok 2020

  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...

  Pełny tekst do pobrania w portalu

• Graphs with equal domination and certified domination numbers

  Publikacja

  • M. Dettlaff
  • M. Lemańska
  • J. Topp
  • M. Miotk
  • R. Ziemann
  • P. Żyliński

  - Opuscula Mathematica - Rok 2019

  A setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...

  Pełny tekst do pobrania w portalu