Bounds on the outer-independent double Italian domination number

نویسندگان

چکیده

An outer-independent double Italian dominating function (OIDIDF)on a graph $G$ with vertex set $V(G)$ is a function$f:V(G)longrightarrow {0,1,2,3}$ such that if $f(v)in{0,1}$ for a vertex $vin V(G)$ then $sum_{uin N[v]}f(u)geq3$,and the set $ {uin V(G)|f(u)=0}$ is independent. The weight ofan OIDIDF $f$ is the value $w(f)=sum_{vin V(G)}f(v)$. Theminimum weight of an OIDIDF on a graph $G$ is called theouter-independent double Italian domination number$gamma_{oidI}(G)$ of $G$. We present sharp lower bounds for theouter-independent double Italian domination number of a tree interms of diameter, vertex covering number and the order of thetree.

برای دانلود باید عضویت طلایی داشته باشید

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Outer independent Roman domination number of trees

‎A Roman dominating function (RDF) on a graph G=(V,E) is a function  f : V → {0, 1, 2}  such that every vertex u for which f(u)=0 is‎ ‎adjacent to at least one vertex v for which f(v)=2‎. ‎An RDF f is called‎‎an outer independent Roman dominating function (OIRDF) if the set of‎‎vertices assigned a 0 under f is an independent set‎. ‎The weight of an‎‎OIRDF is the sum of its function values over ...

متن کامل

On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles

‎Let G be a graph‎. ‎A 2-rainbow dominating function (or‎ 2-RDF) of G is a function f from V(G)‎ ‎to the set of all subsets of the set {1,2}‎ ‎such that for a vertex v ∈ V (G) with f(v) = ∅, ‎the‎‎condition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled‎, wher NG(v)  is the open neighborhood‎‎of v‎. ‎The weight of 2-RDF f of G is the value‎‎$omega (f):=sum _{vin V(G)}|f(v)|$‎. ‎The 2-rainbow‎‎d...

متن کامل

On trees with double domination number equal to 2-outer-independent domination number plus one

A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G = (V,E), a subset D ⊆ V (G) is a 2dominating set if every vertex of V (...

متن کامل

Bounds on the restrained Roman domination number of a graph

A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...

متن کامل

Lower bounds on the signed (total) $k$-domination number

Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...

متن کامل

A Lower Bound on the Double Outer-independent Domination Number of a Tree

A vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V (G) \D is independent. The double outer-independent domination number of a graph G, denoted by γ d (G), is the minimum cardinality of a double outer-indepe...

متن کامل

ذخیره در منابع من

ذخیره در منابع من ذخیره شده در منابع من

{@ msg_add @}

  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی راحت تر خواهید کرد

دانلود متن کامل

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید


عنوان ژورنال:

دوره 6  شماره 1

صفحات  123- 136

تاریخ انتشار 2021-06-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2021