English

On 2-Movable Total Domination in the Join and Corona of Graphs

Combinatorics 2025-08-18 v1

Abstract

Let GG be a connected graph. A non-empty TV(G)T\subseteq V(G) is a 22-\textit{movable total dominating set} of GG if TT is a total dominating set and for every pair x,yTx,y \in T, T\{x,y}T \backslash \{x, y\} is a total dominating set in GG, or there exist u,vV(G)\Tu, v \in V(G) \backslash T such that uu and vv are adjacent to xx and yy, respectively, and (T\{x,y}){u,v}(T \backslash \{x,y\}) \cup \{u,v\} is a total dominating set in GG. The 22-\textit{movable total domination number} of GG, denoted by γmt2(G)\gamma_{mt}^{2}(G), is the minimum cardinality of a 2-movable total dominating set of GG. A 2-movable total dominating set with cardinality equal to γmt2(G)\gamma_{mt}^{2}(G) is called γmt2\gamma_{mt}^{2}-set of GG. This paper present the 2-movable total domination in the join and corona of graphs.

Keywords

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