Strong Resolving Domination in the Lexicographic Product of Graphs

被引：1

作者：

Monsanto, Gerald B. ^{[1
]}

Acal, Penelyn L. ^{[2
]}

Rara, Helen M. ^{[3
]}

机构：

[1] Visayas State Univ Villaba, Coll Teacher Educ Arts & Sci, Villaba 6537, Leyte, Philippines

[2] Univ Sci & Technol Southern Philippines, Dept Math Sci, Cagayan De Oro 9023, Philippines

[3] Mindanao State Univ, Iligan Inst Technol, Premier Res Inst Sci andMathemat, Coll Sci & Math,Ctr Graph Theory Algebra & Anal,De, Iligan 9200, Philippines

来源：

EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2023年 / 16卷 / 01期

关键词：

Strong resolving dominating set; strong resolving domination number; lexicographic product;

D O I：

10.29020/nybg.ejpam.v16i1.4652

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a connected graph. A subset S c V(G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u, v E V(G), there exists a vertex w E S such that u E IG[v, w] or IG[u, w]. The smallest cardinality of a strong resolving dominating set of G is called the strong resolving domination number of G. In this paper, we characterize the strong resolving dominating sets in the lexicographic product of graphs and determine the corresponding strong resolving domination number.

引用

页码：363 / 372

页数：10

共 50 条

[1] Domination in lexicographic product graphs
Zhang, Xindong
Liu, Juan
Meng, Jixiang
[J]. ARS COMBINATORIA, 2011, 101 : 251 - 256
[2] Double domination in lexicographic product graphs
Cabrera Martinez, Abel
Cabrera Garcia, Suitberto
Rodriguez-Velazquez, J. A.
[J]. DISCRETE APPLIED MATHEMATICS, 2020, 284 : 290 - 300
[3] Rainbow domination in the lexicographic product of graphs
Sumenjak, Tadeja Kraner
Rall, Douglas F.
Tepeh, Aleksandra
[J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2133 - 2141
[4] On the Roman domination in the lexicographic product of graphs
Sumenjak, Tadeja Kraner
Pavlic, Polona
Tepeh, Aleksandra
[J]. DISCRETE APPLIED MATHEMATICS, 2012, 160 (13-14) : 2030 - 2036
[5] Domination polynomial of lexicographic product of specific graphs
Alikhani, Saeid
Jahari, Somayeh
[J]. JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2018, 39 (05): : 1019 - 1028
[6] On the super domination number of lexicographic product graphs
Dettlaff, M.
Lemanska, M.
Rodriguez-Velazquez, J. A.
Zuazua, R.
[J]. DISCRETE APPLIED MATHEMATICS, 2019, 263 (118-129) : 118 - 129
[7] Total Roman domination in the lexicographic product of graphs
Campanelli, Nicolas
Kuziak, Dorota
[J]. DISCRETE APPLIED MATHEMATICS, 2019, 263 : 88 - 95
[8] INDEPENDENT SEMITOTAL DOMINATION IN THE LEXICOGRAPHIC PRODUCT OF GRAPHS
Susada, Bryan L.
Eballe, Rolito G.
[J]. ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2023, 39 (02): : 237 - 244
[9] From Italian domination in lexicographic product graphs to w-domination in graphs
Cabrera Martinez, Abel
Estrada-Moreno, Alejandro
Alberto Rodriguez-Velazquez, Juan
[J]. ARS MATHEMATICA CONTEMPORANEA, 2022, 22 (01)
[10] From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Cabrera-Martinez, Abel
Montejano, Luis Pedro
Rodriguez-Velazquez, Juan Alberto
[J]. BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2023, 46 (03)

← 1 2 3 4 5 →