论文标题
通过边缘收缩阻止总统治集
Blocking total dominating sets via edge contractions
论文作者
论文摘要
在本文中，我们研究了确定给定图形$ g $的总统治数是否可以使用一个边缘收缩（称为1边缘收缩（$γ_T$））减少的问题。我们专注于几个图类类，并确定此问题的计算复杂性。通过汇总这些结果，我们设法获得了$ H $ Free图的完整二分法。
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($γ_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.
