English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 57969/91503 (63%)
造訪人次 : 13694021      線上人數 : 44
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/109346


    題名: THE ROMAN BONDAGE NUMBER OF A DIGRAPH
    作者: Sheikholeslami, Seyed Mahmoud;Dehgardi, Nasrin;Volkmann, Lutz;Meierling, Dirk
    關鍵詞: Roman dominating function;Roman domination number;Roman bondage number;digraph
    日期: 2016-12
    上傳時間: 2017-01-17 09:19:46 (UTC+8)
    出版者: 淡江大學出版中心
    摘要: Let D=(V,A)D=(V,A) be a finite and simple digraph. A Roman dominating function on DD is a labeling f:V(D)→{0,1,2}f:V(D)→{0,1,2} such that every vertex with label 0 has an in-neighbor with label 2. The weight of an RDF ff is the value ω(f)=∑v∈Vf(v)ω(f)=∑v∈Vf(v). The minimum weight of a Roman dominating function on a digraph DD is called the Roman domination number, denoted by γR(D)γR(D). The Roman bondage number bR(D)bR(D) of a digraph DD with maximum out-degree at least two is the minimum cardinality of all sets A′⊆AA′⊆A for which γR(D−A′)>γR(D)γR(D−A′)>γR(D). In this paper, we initiate the study of the Roman bondage number of a digraph. We determine the Roman bondage number in several classes of digraphs and give some sharp bounds.
    關聯: Tamkang Journal of Mathematics 47(4), pp.421-431
    DOI: 10.5556/j.tkjm.47.2016.2100
    顯示於類別:[淡江數學期刊] 第47卷第4期

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML283檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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