On 2-Movable Total Domination in the Join and Corona of Graphs
Year: 2026
Type: article
Abstract: Let G be a connected graph. A non-empty set T ⊆ V(G) is a 2-movable total dominating set of G if T is a total dominating set and for every pair x, y ∈ T , T \{x, y} is a total dominating set in G, or there exist u, v ∈ V(G)\T such that u and v are adjacent to x and y, respectively, and (T \{x, y}) ∪ {u, v} is a total dominating set in G. The 2-movable total domination number of G, denoted by γ 2 mt(G), is the minimum cardinality of a 2-movable total dominating set of G. A 2-movable total dominating set with cardinality equal to γ 2 mt(G) is called γ 2 mt-set of G. This paper present the 2-movable total domination in the join and corona of graphs.
Authors: Ariel C. Pedrano, Rolando N. Paluga
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W7075994241
FWCI:
Cites:
Cited by:
Related to:
