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...
Главные авторы: | Hadi Alizadeh, Didem Gözüpek |
---|---|
Формат: | Статья |
Язык: | English |
Опубликовано: |
Discrete Mathematics & Theoretical Computer Science
2021-12-01
|
Серии: | Discrete Mathematics & Theoretical Computer Science |
Предметы: | |
Online-ссылка: | https://dmtcs.episciences.org/7331/pdf |
Схожие документы
-
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
по: Didem Gözüpek, и др.
Опубликовано: (2017-08-01) -
The 2-domination and Roman domination numbers of grid graphs
по: Michaël Rao, и др.
Опубликовано: (2019-05-01) -
On Almost Well-Covered Graphs of Girth at Least 6
по: Tınaz Ekim, и др.
Опубликовано: (2018-11-01) -
On a Class of Graphs with Large Total Domination Number
по: Selim Bahadır, и др.
Опубликовано: (2018-06-01) -
Catalan words avoiding pairs of length three patterns
по: Jean-Luc Baril, и др.
Опубликовано: (2021-04-01)