On 2-Resolving Hop Dominating Sets in the Join, Corona and Lexicographic Product of Graphs

被引:4
作者
Mahistrado, Angelica Mae [1 ]
Rara, Helen [2 ]
机构
[1] Mindanao State Univ, Iligan Inst Technol, Coll Sci & Math, Dept Math & Stat, Iligan 9200, Philippines
[2] Mindanao State Univ, Iligan Inst Technol, Premier Res Inst Sci & Math, Coll Sci & Math,Ctr Graph Theory Algebra & Anal,De, Iligan 9200, Philippines
来源
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2022年 / 15卷 / 04期
关键词
2-resolving hop dominating set; 2-resolving hop domination number; join; corona; lexicographic product;
D O I
10.29020/nybg.ejpam.v15i4.4585
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let G be a connected graph. A set S of vertices in G is a 2-resolving hop dominating set of G if S is a 2-resolving set in G and for every vertex x is an element of V(G)\S, there exists y is an element of S such that dG(x, y) = 2. The minimum cardinality of a set S is called the 2-resolving hop domination number of G and is denoted by gamma 2Rh(G). This study aims to combine the concept of hop domination with the 2-resolving sets of graphs. The main results generated in this study include the characterization of 2-resolving hop dominating sets in the join, corona and lexicographic product of two graphs, as well as their corresponding bounds or exact values.
引用
收藏
页码:1982 / 1997
页数:16
相关论文
共 33 条
[21]   Strong Resolving Domination in the Lexicographic Product of Graphs [J].
Monsanto, Gerald B. ;
Acal, Penelyn L. ;
Rara, Helen M. .
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2023, 16 (01) :363-372
[22]   On the fractional metric dimension of corona product graphs and lexicographic product graphs [J].
Feng, Min ;
Kong, Qian .
ARS COMBINATORIA, 2018, 138 :249-260
[23]   The doubly resolving number of the lexicographic product of graphs [J].
Jannesari, Mohsen .
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2025,
[24]   EDGE-TO-VERTEX GEODETIC SETS IN THE JOIN AND CORONA OF GRAPHS [J].
Cabilin, Elias B. ;
Canoy, Sergio R., Jr. .
ADVANCES AND APPLICATIONS IN MATHEMATICAL SCIENCES, 2019, 18 (03) :263-278
[25]   Forcing Subsets of Connected Co-Independent Hop Domination in the Edge Corona and Lexicographic Product of Graphs [J].
Calanza, Yves Dave L. ;
Rara, Helen M. .
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2022, 15 (04) :1597-1612
[26]   OUTER-CONNECTED 2-DOMINATING SETS OF GRAPHS [J].
Canoy, Sergio R., Jr. ;
Domoloan, Bernadette D. .
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2019, 20 (01) :25-36
[27]   Forcing Connected Co-Independent Hop Domination Numbers in the Join and Corona of Graphs [J].
Calanza, Yves Dave L. ;
Rara, Helen M. .
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2022, 15 (04) :1649-1661
[28]   On fixing sets of composition and corona product of graphs [J].
Javaid, Imran ;
Aasi, M. Shahhaz ;
Irshad, Iqra ;
Salman, Muhammad .
UTILITAS MATHEMATICA, 2018, 109 :17-28
[29]   ON 2-MOVABLE DOMINATION IN THE JOIN AND CORONA OF GRAPHS [J].
Pedrano, Ariel C. ;
Paluga, Rolando N. .
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2025, 42 (02) :89-96
[30]   On k-cost effective domination in the corona and lexicographic product of graphs and its variant [J].
Palco, Jesrael B. ;
Paluga, Rolando N. ;
Malacas, Gina A. .
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023, 15 (04)