Signed total Italian k-domination in digraphs

被引:0
|
作者
Volkmann, Lutz [1 ]
机构
[1] Rhein Westfal TH Aachen, Lehrstuhl Math 2, D-52056 Aachen, Germany
关键词
Digraph; Signed total Italian k-dominating function; Signed total Italian k-domination number; Signed total Roman k-dominating function; Signed total Roman k-domination number; TOTAL ROMAN DOMINATION;
D O I
10.22049/CCO.2023.27872.1377
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let k > 1 be an integer, and let D be a finite and simple digraph with vertex set V (D). A signed total Italian k-dominating function (STIkDF) on a digraph D is a function f : V (D)-+ {-1, 1,2} satisfying the conditions that (i) Ex is an element of N-(v) f (x) > k for each vertex v E V (D), where N-(v) consists of all vertices of D from which arcs go into v, and (ii) each vertex u with f (u) = -1 has an in-neighbor v for which f (v) = 2 or two in-neighbors w and z with f(w) = f(z) = 1. The weight of an STIkDF f is omega(f) = sigma v is an element of V (D) f (v). The signed total Italian k-domination number gamma kstI(D) of D is the minimum weight of an STIkDF on D. In this paper we initiate the study of the signed total Italian k-domination number of digraphs, and we present different bounds on gamma kstI (D). In addition, we determine the signed total Italian k-domination number of some classes of digraphs.
引用
收藏
页码:339 / 351
页数:13
相关论文
共 50 条
  • [1] Signed Roman k-domination in Digraphs
    Lutz Volkmann
    Graphs and Combinatorics, 2016, 32 : 1217 - 1227
  • [2] Signed total Italian k-domination in graphs
    Volkmann, Lutz
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2021, 6 (02) : 171 - 183
  • [3] Signed Roman k-domination in Digraphs
    Volkmann, Lutz
    GRAPHS AND COMBINATORICS, 2016, 32 (03) : 1217 - 1227
  • [4] WEAK SIGNED ROMAN k-DOMINATION IN DIGRAPHS
    Volkmann, Lutz
    OPUSCULA MATHEMATICA, 2024, 44 (02) : 285 - 296
  • [5] Signed total k-domination in graphs
    Wang, Haichao
    Shan, Erfang
    ARS COMBINATORIA, 2013, 111 : 37 - 52
  • [6] Signed total Italian domination in digraphs
    Volkmann, Lutz
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2023, 8 (03) : 457 - 466
  • [7] On the signed (total) k-domination number of a graph
    Liang, Hongyu
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2014, 89 : 87 - 99
  • [8] SIGNED TOTAL K-DOMINATION NUMBERS OF DIRECTED GRAPHS
    Sheikholeslami, S. M.
    Volkmann, L.
    ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2010, 18 (02): : 241 - 251
  • [9] On the k-domination number of digraphs
    Ouldrabah, Lyes
    Blidia, Mostafa
    Bouchou, Ahmed
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (03) : 680 - 688
  • [10] Signed total double Roman k-domination in graphs
    Shahbazi, L.
    Ahangar, H. Abdollahzadeh
    Khoeilar, R.
    Sheikholeslami, S. M.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020, 12 (01)