ON 2-MOVABLE DOMINATION IN THE JOIN AND CORONA OF GRAPHS
Ariel C. Pedrano, Rolando N. Paluga
Source record
Source: Crossref
Published: Nov 28, 2024
DOI: 10.17654/0974165825007
Open original source ↗Source 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 .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.