Work

On 2-movable Domination in the Join and Corona of Graphs

Year: 2024

Type: article

Abstract: 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 .

Source: Advances and Applications in Discrete Mathematics

DOI: 10.17654/0974165825007

Authors: Ariel C. Pedrano, Rolando N. Paluga

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W4404829543

FWCI: 0.201

Cites:

Cited by: 1

Related to: 10