# On the Total Forcing Number of a Graph

## TL;DR

This paper investigates the total forcing number in graphs, exploring its properties, relationships with domination parameters, computational complexity, and bounds based on graph degree, with a focus on connected graphs.

## Contribution

It introduces the concept of total forcing sets, studies their properties, relates them to domination parameters, proves NP-completeness, and establishes bounds for connected graphs.

## Key findings

- Total forcing number relates to domination parameters.
- Deciding the total forcing number is NP-complete.
- Bound of F_t(G) ≤ (Δ/(Δ+1)) * n for connected graphs.

## Abstract

Let $G$ be a simple and finite graph without isolated vertices. In this paper we study forcing sets (zero forcing sets) which induce a subgraph of $G$ without isolated vertices. Such a set is called a total forcing set, introduced and first studied by Davila \cite{Davila}. The minimum cardinality of a total forcing set in $G$ is the total forcing number of $G$, denoted $F_t(G)$. We study basic properties of $F_t(G)$, relate $F_t(G)$ to various domination parameters, and establish $NP$-completeness of the associated decision problem for $F_t(G)$. We also prove that if $G$ is a connected graph of order $n \ge 3$ and maximum degree $\Delta$, then $F_t(G) \le ( \frac{\Delta}{\Delta +1} ) n$, with equality if and only if $G$ is a complete graph $K_{\Delta + 1}$.