Bounds on weak and strong total domination in graphs
| Main Authors: | Akhbari, M.H.; Department of Mathematics, Estahban Branch, Islamic Azad University, Estahban, Iran, Jafari Rad, Nader; Department of Mathematics, Shahrood University of Technology, Shahrood, Iran |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2016
|
| Subjects: | |
| Online Access: |
http://www.ejgta.org/index.php/ejgta/article/view/141 http://www.ejgta.org/index.php/ejgta/article/view/141/pdf_20 |
Daftar Isi:
- 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.