On the Roman domination in the lexicographic product of graphs

被引：35
|
作者：
Sumenjak, Tadeja Kraner [2 ,3 ]
Pavlic, Polona [3 ]
Tepeh, Aleksandra [1 ]
机构：
[1] Univ Maribor, FEECS, SLO-2000 Maribor, Slovenia
[2] Univ Maribor, FKBV, Hoce 2311, Slovenia
[3] Inst Math Phys & Mech, Ljubljana 1000, Slovenia
来源：
DISCRETE APPLIED MATHEMATICS | 2012年 / 160卷 / 13-14期
关键词：
Roman domination; Total domination; Lexicographic product;
D O I：
10.1016/j.dam.2012.04.008
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A Roman dominating function of a graph G = (V, E) is a function f : V -> {0, 1, 2} such that every vertex with f (v) = 0 is adjacent to some vertex with f(v) = 2. The Roman domination number of G is the minimum of w(f) = Sigma(nu is an element of V)f(v) over all such functions. Using a new concept of the so-called dominating couple we establish the Roman domination number of the lexicographic product of graphs. We also characterize Roman graphs among the lexicographic product of graphs. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：2030 / 2036
页数：7
相关论文
共 50 条
  • [1] Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
    Cabrera Martinez, A.
    Garcia-Gomez, C.
    Rodriguez-Velazquez, J. A.
    [J]. FUNDAMENTA INFORMATICAE, 2022, 185 (03) : 201 - 220
  • [2] Total Roman domination in the lexicographic product of graphs
    Campanelli, Nicolas
    Kuziak, Dorota
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 263 : 88 - 95
  • [3] From Total Roman Domination in Lexicographic Product Graphs to Strongly Total Roman Domination in Graphs
    Almerich-Chulia, Ana
    Cabrera Martinez, Abel
    Hernandez Mira, Frank Angel
    Martin-Concepcion, Pedro
    [J]. SYMMETRY-BASEL, 2021, 13 (07):
  • [4] On the weak Roman domination number of lexicographic product graphs
    Valveny, Magdalena
    Perez-Roses, Hebert
    Rodriguez-Velazquez, Juan A.
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 263 : 257 - 270
  • [5] Domination in lexicographic product graphs
    Zhang, Xindong
    Liu, Juan
    Meng, Jixiang
    [J]. ARS COMBINATORIA, 2011, 101 : 251 - 256
  • [6] Closed formulas for the total Roman domination number of lexicographic product graphs
    Martinez, Abel Cabrera
    Rodriguez-Velazquez, Juan Alberto
    [J]. ARS MATHEMATICA CONTEMPORANEA, 2021, 20 (02) : 233 - 241
  • [7] Double domination in lexicographic product graphs
    Cabrera Martinez, Abel
    Cabrera Garcia, Suitberto
    Rodriguez-Velazquez, J. A.
    [J]. DISCRETE APPLIED MATHEMATICS, 2020, 284 : 290 - 300
  • [8] 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
  • [9] Domination polynomial of lexicographic product of specific graphs
    Alikhani, Saeid
    Jahari, Somayeh
    [J]. JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2018, 39 (05): : 1019 - 1028
  • [10] 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
12345