ON 2-MOVABLE DOMINATION IN THE JOIN AND CORONA OF GRAPHS
Let be a connected graph. Then a non-empty is a 2 movable dominating set of if is a dominating set and for every pair is a dominating set in , or there exist such that and are adjacent to and , respectively, and is a dominating set in . The 2-movable domination number of , denoted by , is the minimum cardinality of a 2-movable dominating set of G. A 2-movable dominating set with cardinality equal to is called -set of .
Authors
- Ariel C. Pedrano (ORCID: https://orcid.org/0000-0003-0545-2121)
- Rolando N. Paluga
Publication Details
- Journal
- Advances and Applications in Discrete Mathematics
- Published
- 2024-11-28
- DOI
- https://doi.org/10.17654/0974165825007
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00