Abstract
AbstractLet G be a graph with vertex set V and edge set E, a set $$D\subseteq V$$
D
⊆
V
is a total dominating set if every vertex $$v\in V$$
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 $$\gamma _{t}(G)$$
γ
t
(
G
)
. Given an arbitrary tree graph T, we consider some operators acting on this graph; $$\texttt {S}(T),\texttt {R}(T),\texttt {Q}(T)$$
S
(
T
)
,
R
(
T
)
,
Q
(
T
)
and $$\texttt {T}(T)$$
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.
Funder
Universidad Pablo de Olavide
Publisher
Springer Science and Business Media LLC
Reference15 articles.
1. Basilio, L.A., Castro, J., Leaños, J., Rosario, O.: The differential on graph operator $$Q(G)$$. Simmetry 12(751), 1–8 (2020)
2. Basilio, L. A., Leaños, J., Rosario, O., Sigarreta, J. M.: The differential on graph operator $$R(G)$$. Utilitas Mathematica (2022) (to appear)
3. Bindusree, A.R., Naci Cangul, I., Lokesha, V., Sinan Cevik, A.: Zagreb polynomials of three graph operators. Filomat 30, 1979–1986 (2016)
4. Cabrera, A., Hernández-Mira, Frank A., Sigarreta, J.M., Yero, Ismael G.: On computational and combinatorial properties of the total co-independent domination number of graphs. Comput. J. 62(1), 97–108 (2019)
5. Harary, F., Norman, R.Z.: Some properties of line digraphs. Rendiconti del Circolo Matematico di Palermo 9, 161–168 (1960)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献