دوره 20، شماره 2 - ( 6-1404 )                   جلد 20 شماره 2 صفحات 77-63 | برگشت به فهرست نسخه ها

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Shahbazi L, Abdollahzadeh Ahangar H, Khoeilar R, Sheikholeslami S M. Lower Bounds on Signed Total Double Roman k-domination in Graphs. IJMSI 2025; 20 (2) :63-77
URL: http://ijmsi.ir/article-1-2018-fa.html
Lower Bounds on Signed Total Double Roman k-domination in Graphs. مجله علوم ریاضی و انفورماتیک. 1404; 20 (2) :63-77

URL: http://ijmsi.ir/article-1-2018-fa.html


چکیده:  
A signed total double Roman k-dominating function (STDRkDF) on an isolated-free graph G = (V, E) is a function f : V (G) → {-1, 1, 2, 3} such that (i) every vertex v with f(v) = -1 has at least two neighbors assigned 2 under f or at least one neighbor w with f(w) = 3, (ii) every vertex v with f(v) = 1 has at least one neighbor w with f(w) ≥ 2 and (iii) u∈N(v) f(u) ≥ k holds for any vertex v. The weight of an STDRkDF is the value f(V (G)) = ∑u∈V (G) f(u). The signed total double Roman k-domination number γstdR k (G) is the minimum weight among all signed total double Roman k-dominating functions on G. In this paper we present sharp lower bounds for γstdR 2 (G) and γstdR 3 (G) in terms of the order and the size of the graph G.
نوع مطالعه: پژوهشي | موضوع مقاله: عمومى

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
CAPTCHA

بازنشر اطلاعات
Creative Commons License این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است.

کلیه حقوق این وب سایت متعلق به نشریه علوم ریاضی و انفورماتیک می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2025 CC BY-NC 4.0 | Iranian Journal of Mathematical Sciences and Informatics

Designed & Developed by : Yektaweb