Outer-paired domination in graphs
2020 ◽
Vol 12
(06)
◽
pp. 2050072
Keyword(s):
Let [Formula: see text] be a simple graph with vertex set [Formula: see text] and edge set [Formula: see text]. An outer-paired dominating set [Formula: see text] of a graph [Formula: see text] is a dominating set such that the subgraph induced by [Formula: see text] has a perfect matching. The outer-paired domination number of [Formula: see text], denoted by [Formula: see text], is the minimum cardinality of an outer-paired dominating set of [Formula: see text]. In this paper, we study the outer-paired domination number of graphs and present some sharp bounds concerning the invariant. Also, we characterize all the trees with [Formula: see text].
Keyword(s):
Keyword(s):
2021 ◽
Vol vol. 23, no. 3
(Graph Theory)
◽
2020 ◽
Vol 8
(4S5)
◽
pp. 66-68
Keyword(s):
2020 ◽
Vol 8
(4S5)
◽
pp. 272-276
Keyword(s):
2019 ◽
Vol 11
(06)
◽
pp. 1950071
Keyword(s):
2019 ◽
Vol 12
(3)
◽
pp. 1337-1349
Keyword(s):
2020 ◽
Vol 9
(3)
◽
pp. 1949-1950
Keyword(s):