Computer Science Journal of Moldova (May 2015)

Bounds on Global Total Domination in Graphs

  • Nader Jafari Rad,
  • Elahe Sharifi

Journal volume & issue
Vol. 23, no. 1(67)
pp. 3 – 10

Abstract

Read online

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 bounds for the global total domination number in graphs.

Keywords