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 |
विषय: | |
ऑनलाइन पहुंच: | 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)