---
title: Total Domination Number in Graph Theory
url: https://www.emergentmind.com/topics/total-domination-number
type: topic
---

# Total Domination Number in Graph Theory

A total dominating set in a graph is a subset of vertices such that every vertex has at least one neighbor in the set. The total domination number, denoted $\gamma_t(G)$, is the minimum cardinality of such a set in $G$. This invariant is central in domination theory and intersects with areas including graph products, algebraic graph theory (e.g., zero-divisor graphs of rings), extremal combinatorics, and the study of specific graph classes (e.g., planar graphs, meshes, Knödel graphs).

## 1. Definition and Basic Properties

Let $G=(V,E)$ be a simple undirected graph with no isolated vertices. A subset $S \subseteq V$ is a **total dominating set** (TDS) if every vertex $v\in V$ has a neighbor in $S$, i.e.,
\[
\forall\,v\in V,\;\; N(v) \cap S \neq \emptyset.
\]
The **total domination number** is
\[
\gamma_t(G) = \min\Bigl\{ |S| : S \subseteq V,\; N(v) \cap S \neq \emptyset\;\forall\,v\in V \Bigr\}.
\]
By definition, $\gamma_t(G) \geq 2$ for connected graphs with minimum degree at least 1, and always $\gamma(G) \leq \gamma_t(G)$, where $\gamma(G)$ is the (standard) domination number [2406.08770].

For digraphs $D=(V,A)$ (no loops, simple), total domination requires every vertex to have an in-neighbor in $S$:
\[
\forall\,v\in V,\;\;\exists\,u\in S\; \text{such that } (u,v)\in A.
\]
The total domination number in digraphs, $\gamma_t(D)$, is analogously defined, with the existence of a TDS equivalent to $\min_{v\in V} d_D^-(v)\geq 1$ [2411.04560].

## 2. Lower Bounds and Extremal Cases

Structural lower bounds for $\gamma_t(G)$ are foundational for applications and complexity analyses. Principal lower bounds include:

- **Degree-sequence bound:** For $G$ with degree sequence $d_1 \geq \cdots \geq d_n$,
  \[
  \gamma_t(G) \geq \mathrm{sub}_t(G) := \min \left\{ j : \sum_{i=1}^j d_i \geq n \right\}.
  \]
- **Maximum-degree bound:**
  \[
  \gamma_t(G) \geq \frac{n}{\Delta},
  \]
  where $\Delta$ is the maximum degree.
- **Diameter and radius bounds:** For connected $G$,
  \[
  \gamma_t(G) \geq \Bigl\lceil \frac{\mathrm{diam}(G)+1}{2} \Bigr\rceil,\qquad \gamma_t(G) \geq \mathrm{rad}(G).
  \]
These bounds generalize from the total (distance) $k$-domination framework; for $k=1$, all reduce to bounds for $\gamma_t$ [2406.08770].

**Tightness:** These bounds are attained in several key families:
- Paths $P_n$: $\gamma_t(P_n) = \lceil n/2 \rceil$ and equality in the diameter bound.
- Even cycles $C_{2m}$: $\gamma_t(C_{2m}) = m$.
- Regular graphs, including cycles, realize the $n/\Delta$ bound.

However, such bounds can be weak for star-like or highly connected graphs; further refinements might combine local (degree) and global (distance) parameters or exploit neighborhood overlaps [2406.08770].

## 3. Exact Results in Notable Graph Classes

### Toroidal Meshes and Cubic Knödel Graphs

- **Toroidal meshes** $G_{n,m}=C_n \times C_m$ (Cartesian product of cycles): For $m=3,4$, the total domination number is determined exactly:
  - $G_{n,3}$: $\gamma_t(C_n \times C_3) = \lceil 4n/5 \rceil$
  - $G_{n,4}$: $\gamma_t(C_n \times C_4)$ follows a sharp residue-dependent formula (see [1109.3928]).
- For general $n,m \geq 5$, the asymptotic is $\gamma_t(G_{n,m}) \sim \frac{nm}{4}$ with explicit block constructions providing upper bounds and the regular-graph argument providing the lower bound [1109.3928].

- **Cubic Knödel graphs** $W_{3,n}$ (bipartite, 3-regular, $n$ even $\geq 8$): The total domination number is given by a piecewise function in $n$ mod 10:
  \[
  \gamma_t(W_{3,n}) = \begin{cases}
    4T, & n \equiv 0,6,8 \pmod{10} \\
    4T - 2, & n \equiv 2,4 \pmod{10}
  \end{cases}
  \]
  where $T = \lceil n/10 \rceil$ [1804.02532].

### Hypercubes and Prisms

For hypercubes $Q_n$ and their prisms, the following holds:
- For bipartite $G$, $\gamma_t(G \square K_2) = 2\gamma(G)$.
- For hypercubes, $\gamma_t(Q_{n+1}) = 2\gamma(Q_n)$, and explicit values can be recursively computed [1606.08143].

For non-bipartite $G$, $\gamma_t(G \square K_2)$ can be strictly less than $2\gamma(G)$; the gap can be arbitrarily large [1606.08143].

### Planar Graphs and Near-Triangulations

For near-triangulations $G$ (biconnected planar graphs with all faces except possibly the outer being triangles), it is shown that
\[
\gamma_t(G) \leq \left\lfloor \frac{2n}{5} \right\rfloor
\]
for all $n \geq 5$ except in two exceptional graphs of order 12 [2011.04255].

## 4. Total Domination in Algebraic Graphs

In zero-divisor graphs of commutative rings $\Gamma(R)$, the total domination number often coincides with the standard domination number. The main result is:
\[
R \not\cong \mathbb{Z}_2 \times D\ (\text{with $D$ domain}) \implies \gamma_t(\Gamma(R)) = \gamma(\Gamma(R)).
\]
The sole exception is $R \cong \mathbb{Z}_2 \times D$, where $\gamma = 1$ and $\gamma_t = 2$ [2506.02953]. This equality is established by analyzing girth, loop structure, and universal annihilators within the ring.

## 5. Orientations and Extremal Constructions

For a simple undirected $G$, orientable total domination numbers are defined as follows:
- $\mathrm{DOM}_t(G)$: The maximum total domination number over all valid orientations (each vertex has indegree at least one).
- $\mathrm{dom}_t(G)$: The minimum over valid orientations.

Key results include:
- $\mathrm{DOM}_t(G) = |V(G)|$ if and only if $G$ is a disjoint union of cycles.
- All connected graphs $G$ in specific families $F_1, F_2, F_3$ can satisfy $\mathrm{DOM}_t(G)=|V(G)|-1$, and the difference between $\mathrm{DOM}_t(G)$ and $\mathrm{dom}_t(G)$ can be as large as $|V(G)|-4$ by suitable orientation choices [2411.04560].

## 6. Algorithmic and Structural Techniques

The computation of $\gamma_t(G)$ is combinatorially complex for general graphs. Proof techniques include:
- **Double counting and neighborhood overlap analysis:** Exploited in regular graphs and product graphs [1109.3928], [1804.02532].
- **Inductive and decomposition approaches:** Used in planar and near-triangulation settings through vertex deletion, edge contraction, and reduction to smaller subgraphs [2011.04255].
- **Hypergraph transversals:** Critical for establishing equivalences with hitting set problems, particularly in product and bipartite graphs [1606.08143].

## 7. Open Problems and Extensions

Significant open questions remain, especially in product graphs. Determining $\gamma_t(C_n \times C_m)$ exactly for $n,m \geq 5$ is unresolved, with known bounds off by $O(n+m)$ depending on residue classes [1109.3928].

Directions for further research include:
- Combining local and global graph parameters to yield tighter lower bounds, e.g., refining $\mathrm{sub}_t(G)$ by accounting for higher-order neighborhood overlap [2406.08770].
- Investigation of weighted and fractional total domination parameters, with analogous lower bounds expected via combinatorial arguments.
- Structural bounds for orientable total domination numbers as explicit functions of edge density and other global invariants [2411.04560].

---

**Summary Table: Key Lower Bounds for $\gamma_t(G)$ in Simple Graphs**

| Bound Type               | Formula                                                   | Sharpness Example           |
|--------------------------|----------------------------------------------------------|-----------------------------|
| Degree-sequence          | $\mathrm{sub}_t(G)$                                      | Paths, cycles               |
| Max degree               | $n/\Delta$                                               | Regular graphs              |
| Diameter                 | $\lceil (\mathrm{diam}(G)+1)/2 \rceil$                   | Paths, even cycles          |
| Radius                   | $\mathrm{rad}(G)$                                        | Varies                      |

---

The total domination number serves as a robust quantitative invariant, deeply linked to combinatorial structure, graph classes, algebraic constructions, and product operations. The breadth of exact results, sharp bounds, and open questions underscores its foundational role in modern domination theory.

Source: https://www.emergentmind.com/topics/total-domination-number