Relating the total domination number and the annihilation number for quasi-trees and some composite graphs

Hongbo Hua, Xinying Hua, Sandi Klavžar +1

The total domination number ${\gamma }_t(G)$ of a graph $G$ is the cardinality of a smallest set $D\subseteq V(G)$ such that each vertex of $G$ has a neighbor in $D$. The annihilation nu…