透過您的圖書館登入
IP:3.14.251.36

摘要


Let D be a finite simple digraph with vertex set V(D). A twin signed Roman dominating function on the digraph D is a function f: V(D) → {-1, 1, 2} satisfying the conditions that (i) Σ_(x∈N^-[v]) f(x) ≥ 1 and Σ_(x∈N^+[v]) f(x) ≥ 1 for each v ∈ V(D), where N^-[v] (resp. N^+[v]) consists of v and all in-neighbors (resp. out-neighbors) of v, and (ii) every vertex u for which f(u) = -1 has an in-neighbor v and an out-neighbor w for which f(v) = f(w) = 2. A set {f_1, f_2, ..., f_d } of distinct twin signed Roman dominating functions on D with the property that Σ_(i=1)^d f_i(v) ≤ 1 for each v ∈ V(D), is called a twin signed Roman dominating family (of functions) on D. The maximum number of functions in a twin signed Roman dominating family on D is the twin signed Roman domatic number of D, denoted by d_(sR)^*(D). In this paper, we initiate the study of the twin signed Roman domatic number in digraphs and we present some sharp bounds on d_(sR)^*(D). In addition, we determine the twin signed Roman domatic number of some classes of digraphs.

關鍵字

無資料

被引用紀錄


Chiu, Y. C. (2014). 分散式系統之自我穩定極小控制集演算法與凱氏圖之正負號星控制數 [doctoral dissertation, National Chiao Tung University]. Airiti Library. https://doi.org/10.6842/NCTU.2014.00642
Tsai, Y. C. (2008). 低功率內容可定址記憶體之設計與分析 [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2008.10368

延伸閱讀