2000 character limit reached
Blocking total dominating sets via edge contractions (2009.08806v1)
Published 18 Sep 2020 in cs.DM
Abstract: In this paper, we study the problem of deciding whether the total domination number of a given graph $G$ can be reduced using exactly one edge contraction (called 1-Edge Contraction($\gamma_t$)). We focus on several graph classes and determine the computational complexity of this problem. By putting together these results, we manage to obtain a complete dichotomy for $H$-free graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.