Bounds on Global Total Domination in Graphs
A subset $S$ of vertices in a graph $G$ is a \textit{global total dominating set}, or just GTDS, if $S$ is a \textit{total dominating set} of both $G$ and $\overline{G}$. The \textit{global total domination number} $\gamma_{gt}(G)$ of $G$ is the minimum cardinality of a GTDS of $G$. We present b...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2015-05-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v23-n1/v23-n1-(pp3-10).pdf.pdf |