# Bounds on Weak and Strong Total Domination in Graphs

## Abstrak

A set $D$ of vertices in a graph $G=(V,E)$ is a total dominatingset if every vertex of $G$ is adjacent to some vertex in $D$. Atotal dominating set $D$ of $G$ is said to be weak if everyvertex $v\in V-D$ is adjacent to a vertex $u\in D$ such that$d_{G}(v)\geq d_{G}(u)$. The weak total domination number$\gamma_{wt}(G)$ of $G$ is the minimum cardinality of a weaktotal dominating set of $G$. A total dominating set $D$ of $G$ issaid to be strong if every vertex $v\in V-D$ is adjacent to avertex $u\in D$ such that $d_{G}(v)\leq d_{G}(u)$. The strongtotal domination number $\gamma_{st}(G)$ of $G$ is the minimumcardinality of a strong total dominating set of $G$. We presentsome bounds on weak and strong total domination number of a graph.

### Metrics

• 203 kali dilihat
• 100 kali diunduh

### Jurnal

Electronic Journal of Graph Theory and Applications

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to ... tampilkan semua