کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4949949 | 1440207 | 2016 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the signed total Roman domination and domatic numbers of graphs
ترجمه فارسی عنوان
در سلسله امضای کل رمضان رومی و اعداد دومی از نمودارها
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
کل تابع غالب رومی امضا شده، تعداد کل سلطنت رومی امضا شده، تعداد کل رومیان رومی امضا شده،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
چکیده انگلیسی
A signed total Roman dominating function on a graph G is a function f:V(G)â¶{â1,1,2} such that âuâN(v)f(u)â¥1 for every vertex vâV(G), where N(v) is the neighborhood of v, and every vertex uâV(G) for which f(u)=â1 is adjacent to at least one vertex w for which f(w)=2. The signed total Roman domination number of a graph G, denoted by γstR(G), equals the minimum weight of a signed total Roman dominating function. A set {f1,f2,â¦,fd} of distinct signed total Roman dominating functions on G with the property that âi=1dfi(v)â¤1 for each vâV(G), is called a signed total Roman dominating family (of functions) on G. The maximum number of functions in a signed total Roman dominating family on G is the signed total Roman domatic number of G, denoted by dstR(G). In this paper we continue the investigation of the signed total Roman domination number, and we initiate the study of the signed total Roman domatic number in graphs. We present sharp bounds for γstR(G) and dstR(G). In addition, we determine the total signed Roman domatic number of some graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 214, 11 December 2016, Pages 179-186
Journal: Discrete Applied Mathematics - Volume 214, 11 December 2016, Pages 179-186
نویسندگان
Lutz Volkmann,