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...
Hoofdauteurs: | Hadi Alizadeh, Didem Gözüpek |
---|---|
Formaat: | Artikel |
Taal: | English |
Gepubliceerd in: |
Discrete Mathematics & Theoretical Computer Science
2021-12-01
|
Reeks: | Discrete Mathematics & Theoretical Computer Science |
Onderwerpen: | |
Online toegang: | https://dmtcs.episciences.org/7331/pdf |
Gelijkaardige items
-
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
door: Didem Gözüpek, et al.
Gepubliceerd in: (2017-08-01) -
The 2-domination and Roman domination numbers of grid graphs
door: Michaël Rao, et al.
Gepubliceerd in: (2019-05-01) -
On Almost Well-Covered Graphs of Girth at Least 6
door: Tınaz Ekim, et al.
Gepubliceerd in: (2018-11-01) -
On a Class of Graphs with Large Total Domination Number
door: Selim Bahadır, et al.
Gepubliceerd in: (2018-06-01) -
Catalan words avoiding pairs of length three patterns
door: Jean-Luc Baril, et al.
Gepubliceerd in: (2021-04-01)