Table of Content
Total Domination
Open AccessArticleOn 2-Movable Total Domination in the Join and Corona of Graphs
Ariel C. Pedrano* and Rolando N. Paluga
Annals of Communications in Mathematics 2026,
9(3),
5
DOI: https://doi.org/10.62072/acm.2026.09037
Abstract:Let \( G \) be a connected graph. A non-empty set \( T \subseteq V(G) \) is a 2-movable total dominating set of \( G \) if \( T \) is a total dominating set and for every pair \( x,y \in T \), \( T \setminus \{x,y\} \) is a total dominating set in \( G \), or there exist \( u,v \in V(G) \setminus T \) such that \( u \) and \( v \) are adjacent to \( x \) and \( y \), respectively, and \( (T \setminus \{x,y\}) \cup \{u,v\} \) is a total dominating set in \( G \). The 2-movable total domination number of \( G \), denoted by \( \gamma_{mt}^{2}(G) \), is the minimum cardinality of a 2-movable total dominating set of \( G \). A 2-movable total dominating set with cardinality equal to \( \gamma_{mt}^{2}(G) \) is called a \( \gamma_{mt}^{2} \)-set of \( G \). This paper presents the 2-movable total domination in the join and corona of graphs.




