On 2-Movable Connected Domination of Some Graphs
Year: 2026
Type: article
Abstract: A connected dominating set C in G is a 2-movable connected dominating set of G if for every pair x, y ∈ C, C ⧵ {x, y} is a connected dominating set in G, or there exists u, v ∈ V(G) ⧵ C such that u and v are adjacent to x and y, respectively, and (C ⧵ {x, y}) ∪ {u, v} is a connected dominating set of G. The minimum cardinality of a 2-movable connected dominating set of G, denoted by γ 2 mc(G) is the 2-movable connected domination number of G. A 2-movable connected dominating set with cardinality γ 2 mc(G) is called a minimum 2-movable connected dominating set or a γ 2 mc-set of G. In this paper, the researcher obtained the 2-movable connected domination number of the Complete Graph Kn, Join Graph G + H, and Generalized Wheel Graph Wm,n.
Authors: Ariel C. Pedrano, Grachelle M. Bangcal
Institution: University of Southeastern Philippines
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W7204654707