Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1810.06872

Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width

Esther Galby·Andrea Munaro·Bernard Ries
View original source ↗Read source document ↗Export metadata ↓

Abstract

A semitotal dominating set of a graph $G$ with no isolated vertex is a dominating set $D$ of $G$ such that every vertex in $D$ is within distance two of another vertex in $D$. The minimum size $\gamma_{t2}(G)$ of a semitotal dominating set of $G$ is squeezed between the domination number $\gamma(G)$ and the total domination number $\gamma_{t}(G)$. \textsc{Semitotal Dominating Set} is the problem of finding, given a graph $G$, a semitotal dominating set of $G$ of size $\gamma_{t2}(G)$. In this paper, we continue the systematic study on the computational complexity of this problem when restricted to special graph classes. In particular, we show that it is solvable in polynomial time for the class of graphs with bounded mim-width by a reduction to \textsc{Total Dominating Set} and we provide several approximation lower bounds for subclasses of subcubic graphs. Moreover, we obtain complexity dichotomies in monogenic classes for the decision versions of \textsc{Semitotal Dominating Set} and \textsc{Total Dominating Set}. Finally, we show that it is $\mathsf{NP}$-complete to recognise the graphs such that $\gamma_{t2}(G) = \gamma_{t}(G)$ and those such that $\gamma(G) = \gamma_{t2}(G)$, even if restricted to be planar and with maximum degree at most $4$, and we provide forbidden induced subgraph characterisations for the graphs heriditarily satisfying either of these two equalities.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Esther Galby, Andrea Munaro, Bernard Ries. 2018-10-16. Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. https://arxiv.org/abs/1810.06872

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗