A New Upper Bound on Total Domination Number of Bipartite Graphs

Saieed Akbari, Pooyan Ehsani, Sahar Qajar +2

Let $G$ be a graph. A subset $S\subseteq V(G)$ is called a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $S$. The total domination number, $…