RT Journal Article
T1 Total Domination on Tree Operators
A1 Bermudo Navarrete, Sergio
K1 Total domination
K1 Graph operation
AB Let G be a graph with vertex set V and edge set E, a set D V is a total dominating set if every vertex v V has at least one neighbor in D. The minimum cardinality among all total dominating sets is called the total domination number, and it is denoted by t(G). Given an arbitrary tree graph T, we consider some operators acting on this graph; S(T), R(T), Q(T) and T(T), and we give bounds of the total domination number of these new graphs using other parameters in the graph T. We also give the exact value of the total domination number in some of them.
PB Springer Nature
YR 2022
FD 2022-12-20
LK http://hdl.handle.net/10433/15508
UL http://hdl.handle.net/10433/15508
LA en
NO Mediterranean Journal of Mathematics (2023) 20:42
NO Universidad Pablo de Olavide. Departamento de Economía, Métodos Cuantitativos e Historia Económica
DS RIO
RD May 24, 2026