淡江大學機構典藏:Item 987654321/109357
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62830/95882 (66%)
造访人次 : 4037971      在线人数 : 559
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/109357


    题名: TWIN SIGNED ROMAN DOMINATION NUMBERS IN DIRECTED GRAPHS
    作者: Sheikholeslami, Seyed Mahmoud;Bodaghli, Asghar;Volkmann, Lutz
    关键词: twin signed Roman dominating function;twin signed Roman domination number;directed graph
    日期: 2016-09
    上传时间: 2017-01-17 09:46:51 (UTC+8)
    出版者: 淡江大學出版中心
    摘要: Let DD be a finite simple digraph with vertex set V(D)V(D) and arc set A(D)A(D). A twin signed Roman dominating function (TSRDF) on the digraph DD is a function f:V(D)→{−1,1,2}f:V(D)→{−1,1,2} satisfying the conditions that (i) ∑x∈N−[v]f(x)≥1∑x∈N−[v]f(x)≥1 and ∑x∈N+[v]f(x)≥1∑x∈N+[v]f(x)≥1 for each v∈V(D)v∈V(D), where N−[v]N−[v] (resp. N+[v]N+[v]) consists of vv and all in-neighbors (resp. out-neighbors) of vv, and (ii) every vertex uu for which f(u)=−1f(u)=−1 has an in-neighbor vv and an out-neighbor ww for which f(v)=f(w)=2f(v)=f(w)=2. The weight of an TSRDF ff is ω(f)=∑v∈V(D)f(v)ω(f)=∑v∈V(D)f(v). The twin signed Roman domination number γ∗sR(D)γsR∗(D) of DD is the minimum weight of an TSRDF on DD. In this paper, we initiate the study of twin signed Roman domination in digraphs and we present some sharp bounds on γ∗sR(D)γsR∗(D). In addition, we determine the twin signed Roman domination number of some classes of digraphs.
    關聯: Tamkang Journal of Mathematics 47(3), pp.357-371
    DOI: 10.5556/j.tkjm.47.2016.2035
    显示于类别:[淡江數學期刊] 第47卷第3期

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML367检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈