A Partition-Complement Transfer Theorem Resolving a Total-Domination Conjecture
Total domination becomes difficult to transfer across degree classes when a class containsan isolated vertex. We resolve this obstruction by pairing the class with its complementaryinduced graph and charging isolated vertices to neighbours outside the class. The resultingpartition-complement theorem proves, with a singleton-class improvement, the total-dominationconjecture posed by Chen for the δ-complement; its proof is combinatorial and does not dependon computation.
Authors
- Tony Newton (ORCID: https://orcid.org/0009-0009-9189-6431)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.5281/zenodo.24346434
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint