Repozytorium publikacji - Politechnika Gdańska

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 or at least two neighbors inVG−D. The cardinality of a smallest (largest minimal,respectively) certified dominating set ofGis called the certified (upper certified, respectively)domination number ofGand is denoted byγcer(G) (Γcer(G), respectively). In this paperrelations between domination, upper domination, certified domination and upper certifieddomination numbers of a graph are studied

Autorzy

• dr inż. Magda Dettlaff link otwiera się w nowej karcie ,
• dr inż. Magdalena Lemańska link otwiera się w nowej karcie ,
• Jerzy Topp,
• mgr inż. Mateusz Miotk,
• Radosław Ziemann,
• Paweł Żyliński