On 2-Movable Total Domination in the Join and Corona of Graphs
Combinatorics
2025-08-18 v1
Abstract
Let be a connected graph. A non-empty is a -\textit{movable total dominating set} of if is a total dominating set and for every pair , is a total dominating set in , or there exist such that and are adjacent to and , respectively, and is a total dominating set in . The -\textit{movable total domination number} of , denoted by , is the minimum cardinality of a 2-movable total dominating set of . A 2-movable total dominating set with cardinality equal to is called -set of . This paper present the 2-movable total domination in the join and corona of graphs.
Cite
@article{arxiv.2508.10952,
title = {On 2-Movable Total Domination in the Join and Corona of Graphs},
author = {Ariel C. Pedrano and Rolando N. Paluga},
journal= {arXiv preprint arXiv:2508.10952},
year = {2025}
}
Comments
This is a new study about movable domination