arXiv:2603.14749 · v3

The Counting General Dominating Set Framework

首次提交 2026-03-16 10:36

版本更新 2026-10-27 21:29

雷达观测 2026-10-29 00:35

摘要

We introduce a new framework of counting problems called #GDS that generalizes #$(σ, ρ)$-Set, a class of domination-type problems that includes counting dominating sets and counting total dominating sets. We explore the intricate relation between #GDS and the well-known Holant framework. We adapt the technique of gadget construction of Holant to the #GDS framework; using this technique, we prove the #P-completeness of counting dominating sets for 3-regular planar bipartite simple graphs. Using interpolation for powered Holant problems and a special reduction method via symmetric bipartite graphs, we also prove the #P-completeness of counting total dominating sets for the same graph class.