On the Complexity of Problems on Graphs Defined on Groups

Bireswar Das; Dipan Dey; Jinia Ghosh

Home/Archive/arXiv

arXiv · 2507.05860

On the Complexity of Problems on Graphs Defined on Groups

Bireswar Das·Dipan Dey·Jinia Ghosh

View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the complexity of graph problems on graphs defined on groups, especially power graphs. We observe that an isomorphism invariant problem, such as Hamiltonian Path, Partition into Cliques, Feedback Vertex Set, Subgraph Isomorphism, cannot be NP-complete for power graphs, commuting graphs, enhanced power graphs, directed power graphs, and bounded-degree Cayley graphs, assuming the Exponential Time Hypothesis (ETH). An analogous result holds for isomorphism invariant group problems: no such problem can be NP-complete unless ETH is false. We show that the Weighted Max-Cut problem is NP-complete in power graphs. We also show that, unless ETH is false, the Graph Motif problem cannot be solved in quasipolynomial time on power graphs, even for power graphs of cyclic groups. We study the recognition problem of power graphs when the adjacency matrix or list is given as input and show that for abelian groups and some classes of nilpotent groups, it is solvable in polynomial time.

Explore related subjects

cs.CC cs.DM math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Bireswar Das, Dipan Dey, Jinia Ghosh. 2025-07-08. On the Complexity of Problems on Graphs Defined on Groups. https://arxiv.org/abs/2507.05860

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

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

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↗