Bounds on weak and strong total domination in graphs
A set $D$ of vertices in a graph $G=(V,E)$ is a total dominating<br />set if every vertex of $G$ is adjacent to some vertex in $D$. A<br />total dominating set $D$ of $G$ is said to be weak if every<br />vertex $v\in V-D$ is adjacent to a vertex $u\in D$ such that<br />$d_{G}...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2016-04-01
|
| Series: | Electronic Journal of Graph Theory and Applications |
| Subjects: | |
| Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/141 |