Forcing Subsets for γc-sets and γt-sets in the Lexicographic Product of Graphs
2019 ◽
Vol 12
(4)
◽
pp. 1779-1786
Keyword(s):
In this paper, the connected dominating sets and total dominating sets in the lexicographic product of two graphs are characterized. Further, the connected domination, total domination, forcing connected domination and forcing total domination numbers of these graphs are determined.
2014 ◽
Vol 8
◽
pp. 1973-1980
Keyword(s):
2019 ◽
Vol 12
(4)
◽
pp. 1410-1425
2021 ◽
Vol 14
(3)
◽
pp. 829-841
2018 ◽
Vol 11
(05)
◽
pp. 1850075
2021 ◽
Vol 14
(2)
◽
pp. 578-589
2019 ◽
Vol 20
(1)
◽
pp. 13-24
2021 ◽
Vol 14
(3)
◽
pp. 803-815
2020 ◽
Vol 13
(4)
◽
pp. 779-793