Token-Sliding Reconfiguration of Minimum Power Domination in Complete Multipartite Graphs: An Exact Classification and a Diameter-Three Theorem
We determine the minimum power-dominating sets and their token-sliding reconfigurationgraph for every complete multipartite graph with at least two parts. Explicit formulas countconfigurations and legal transitions, characterize connectivity, and determine componentdiameters. When every part has size at least three, adding a third part changes an edgelesstwo-part reconfiguration graph into a connected graph of diameter exactly three.
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.24339053
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint