On the doubly connected domination number of a graph
Keyword(s):
AbstractFor a given connected graph G = (V, E), a set $$D \subseteq V(G)$$ is a doubly connected dominating set if it is dominating and both 〈D〉 and 〈V (G)-D〉 are connected. The cardinality of the minimum doubly connected dominating set in G is the doubly connected domination number. We investigate several properties of doubly connected dominating sets and give some bounds on the doubly connected domination number.
2015 ◽
Vol 26
(02)
◽
pp. 229-240
2014 ◽
Vol 07
(04)
◽
pp. 1450054
2020 ◽
Vol 8
(4S4)
◽
pp. 93-96
2013 ◽
Vol 05
(03)
◽
pp. 1350009
Keyword(s):
Keyword(s):
2020 ◽
Vol 12
(04)
◽
pp. 2050052
◽
2017 ◽
Vol 09
(05)
◽
pp. 1750069
◽
Keyword(s):
2021 ◽
Vol 14
(3)
◽
pp. 1015-1023
Keyword(s):