Total Domination on Some Graph Operators
Keyword(s):
Let G=(V,E) be a graph; a set D⊆V is a total dominating set if every vertex v∈V has, at least, one neighbor in D. The total domination number γt(G) is the minimum cardinality among all total dominating sets. Given an arbitrary graph G, we consider some operators on this graph; S(G),R(G), and Q(G), and we give bounds or the exact value of the total domination number of these new graphs using some parameters in the original graph G.
2021 ◽
Vol 14
(2)
◽
pp. 578-589
2021 ◽
Vol 14
(1)
◽
pp. 149-163
2019 ◽
Vol 11
(01)
◽
pp. 1950004
2020 ◽
Vol 8
(4S5)
◽
pp. 272-276
Keyword(s):