Metraipolis › archive › dc_44ce7a76ea93
A Degree Threshold for Independent Domination in Generalized Prisms — arXiv:2608.07956
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.07956
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:09:10.463Z
- SHA-256 of the archived text
bd41e1258d7aba6282b96988edfe3bc8b24e77f1be928667719a12534f7e322d- Stable URL of this page
https://metraipolis.com/documento/dc_44ce7a76ea93
How to cite
A Degree Threshold for Independent Domination in Generalized Prisms — arXiv:2608.07956 — arXiv (en), https://arxiv.org/abs/2608.07956 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_44ce7a76ea93 (Metraipolis archive dc_44ce7a76ea93, sha256 bd41e1258d7aba6282b96988edfe3bc8b24e77f1be928667719a12534f7e322d)
BibTeX
@misc{dc44ce7a76ea93,
title = {A Degree Threshold for Independent Domination in Generalized Prisms — arXiv:2608.07956},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.07956},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_44ce7a76ea93; sha256 bd41e1258d7aba6282b96988edfe3bc8b24e77f1be928667719a12534f7e322d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.07956. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study per-colour independent (k)-rainbow domination and its connection with independent domination in generalized prisms. Building on the known prism identity and the trivial regime above the maximum degree, we focus on the boundary case where the number of colours equals the maximum degree. For every fixed (k\ge 3), we prove that the decision problem remains NP-complete even on a highly restricted class of graphs: (C_4)-free, bipartite, ((k,2))-biregular subdivision graphs arising from simple (k)-regular graphs. The reduction gives an exact correspondence between optimal rainbow-independent dominating functions on the subdivision graph and proper (k)-edge-colourings of the original graph. We also introduce an excess parameter measuring how far the domination number lies above its natural lower bound. For cubic graphs, this excess coincides with the classical edge-colouring degree and therefore with standard resistance parameters for subcubic graphs. These results reveal a sharp one-unit threshold: above the maximum degree the problem becomes trivial for every graph, while at the boundary NP-hard instances already occur within a very narrow structural family. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.CO). Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2608.07956 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T09:05:33.601Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).