Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2202.02010

Globally Minimal Defensive Alliances: A Parameterized Perspective

Ajinkya Gaikwad·Soumen Maity
View original source ↗Read source document ↗Export metadata ↓

Abstract

A defensive alliance in an undirected graph $G=(V,E)$ is a non-empty set of vertices $S$ satisfying the condition that every vertex $v\in S$ has at least as many neighbours (including itself) in $S$ as it has in $V\setminus S$. We consider the notion of global minimality in this paper. We are interested in globally minimal defensive alliance of maximum size. This problem is known to be NP-hard but its parameterized complexity remains open until now. We enhance our understanding of the problem from the viewpoint of parameterized complexity by showing that the Globally Minimal Defensive Alliance problem is FPT parameterized by the neighbourhood diversity of the input graph. The result for neighborhood diversity implies that the problem is FPT parameterized by vertex cover number also. We prove that the problem parameterized by the vertex cover number of the input graph does not admit a polynomial compression unless coNP $\subseteq$ NP/poly. We show that the problem is W[1]-hard parameterized by a wide range of fairly restrictive structural parameters such as the feedback vertex set number, pathwidth, treewidth and treedepth. We also proved that, given a vertex $r \in V(G)$, deciding if $G$ has a globally minimal defensive alliance of any size containing vertex $r$ is NP-complete.

Explore related subjects

cs.CCcs.DS

Keep this discovery

BibTeXRIS

Ajinkya Gaikwad, Soumen Maity. 2022-02-04. Globally Minimal Defensive Alliances: A Parameterized Perspective. https://arxiv.org/abs/2202.02010

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↗