Upper paired domination versus upper domination

A paired dominating set $P$ is a dominating set with the additional property that $P$ has a perfect matching. While the maximum cardainality of a minimal dominating set in a graph $G$ is called the upper domination number of $G$, denoted by $\Gamma(G)$, the maximum cardinality of a minimal paired do...

Ful tanımlama

Detaylı Bibliyografya
Asıl Yazarlar: Hadi Alizadeh, Didem Gözüpek
Materyal Türü: Makale
Dil:English
Baskı/Yayın Bilgisi: Discrete Mathematics & Theoretical Computer Science 2021-12-01
Seri Bilgileri:Discrete Mathematics & Theoretical Computer Science
Konular:
Online Erişim:https://dmtcs.episciences.org/7331/pdf