Double domination in lexicographic product graphs

被引：16
|
作者：
Cabrera Martinez, Abel [1 ]
Cabrera Garcia, Suitberto [2 ]
Rodriguez-Velazquez, J. A. [1 ]
机构：
[1] Univ Rovira & Virgili, Dept Engn Informat & Matemat, Av Paisos Catalans 26, Tarragona 43007, Spain
[2] Univ Politecn Valencia, Dept Estadist & Invest Operat Aplicadas & Calidad, Camino Vera S-N, Valencia 46022, Spain
来源：
DISCRETE APPLIED MATHEMATICS | 2020年 / 284卷
关键词：
Double domination; Total domination; Total Roman {2}-domination; Lexicographic product; TOTAL ROMAN DOMINATION; NUMBER;
D O I：
10.1016/j.dam.2020.03.045
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In a graph G, a vertex dominates itself and its neighbours. A subset S subset of V(G) is said to be a double dominating set of G if S dominates every vertex of G at least twice. The minimum cardinality among all double dominating sets of G is the double domination number. In this article, we obtain tight bounds and closed formulas for the double domination number of lexicographic product graphs G o H in terms of invariants of the factor graphs G and H. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码：290 / 300
页数：11
相关论文
共 50 条
  • [1] Double total domination in the generalized lexicographic product of graphs
    Cabrera-Martinez, Abel
    Villamar, Ismael Rios
    Rueda-Vazquez, Juan M.
    Sigarreta Almira, Jose M.
    [J]. QUAESTIONES MATHEMATICAE, 2024, 47 (03) : 689 - 703
  • [2] Domination in lexicographic product graphs
    Zhang, Xindong
    Liu, Juan
    Meng, Jixiang
    [J]. ARS COMBINATORIA, 2011, 101 : 251 - 256
  • [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] Strong Resolving Domination in the Lexicographic Product of Graphs
    Monsanto, Gerald B.
    Acal, Penelyn L.
    Rara, Helen M.
    [J]. EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2023, 16 (01): : 363 - 372
  • [7] 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
  • [8] Total Roman domination in the lexicographic product of graphs
    Campanelli, Nicolas
    Kuziak, Dorota
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 263 : 88 - 95
  • [9] 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
  • [10] 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)
12345