ON 2-MOVABLE DOMINATION IN THE JOIN AND CORONA OF GRAPHS

被引：0

作者：

Pedrano, Ariel C. ^{[1
]}

Paluga, Rolando N. ^{[2
]}

机构：

[1] Univ Southeastern Philippines, Dept Math & Stat, Davao, Philippines

[2] Caraga State Univ, Math Dept, Butuan City, Philippines

来源：

ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS | 2025年 / 42卷 / 02期

关键词：

domination; 2-movable domination; corona; join;

D O I：

10.17654/0974165825007

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a connected graph. Then a non-empty S subset of V(G) is a 2movable dominating set of G if S is a dominating set and for every pair x, y is an element of S, S - {x, y} is a dominating set in G, or there exist u, v is an element of V (G)\S such that u and v are adjacent to x and y, respectively, and (S\{x, y}) boolean OR {u, v} is a dominating set in G. The 2-movable domination number of G , denoted by gamma 2 m ( G ) , is the minimum cardinality of a 2-movable dominating set of G . A 2-movable dominating set with cardinality equal to m ( G ) gamma is called 2 2 gamma m-set of G . This paper obtains 2-movable domination numbers for the corona , join of graphs.

引用

页码：89 / 96

页数：8