Javascript must be enabled to continue!
Weak Signed Roman Domination in Digraphs
View through CrossRef
Let $D$ be a finite and simple digraph with vertex set $V(D)$. A weak signed Roman dominating function (WSRDF) on a digraph $D$ is a function $f:V(D)\rightarrow\{-1,1,2\}$ satisfying the condition that $\sum_{x\in N^-[v]}f(x)\ge 1$ for each $v\in V(D)$, where $N^-[v]$ consists of $v$ and allvertices of $D$ from which arcs go into $v$. The weight of a WSRDF $f$ is $\sum_{v\in V(D)}f(v)$. The weak signed Roman domination number $\gamma_{wsR}(D)$ of $D$ is the minimum weight of a WSRDF on $D$. In this paper we initiate the study of the weak signed Roman domination number of digraphs, and we present different bounds on $\gamma_{wsR}(D)$. In addition, we determine the weak signed Roman domination number of some classesof digraphs.
Title: Weak Signed Roman Domination in Digraphs
Description:
Let $D$ be a finite and simple digraph with vertex set $V(D)$.
A weak signed Roman dominating function (WSRDF) on a digraph $D$ is a function $f:V(D)\rightarrow\{-1,1,2\}$ satisfying the condition that $\sum_{x\in N^-[v]}f(x)\ge 1$ for each $v\in V(D)$, where $N^-[v]$ consists of $v$ and allvertices of $D$ from which arcs go into $v$.
The weight of a WSRDF $f$ is $\sum_{v\in V(D)}f(v)$.
The weak signed Roman domination number $\gamma_{wsR}(D)$ of $D$ is the minimum weight of a WSRDF on $D$.
In this paper we initiate the study of the weak signed Roman domination number of digraphs, and we present different bounds on $\gamma_{wsR}(D)$.
In addition, we determine the weak signed Roman domination number of some classesof digraphs.
Related Results
Hubungan Perilaku Pola Makan dengan Kejadian Anak Obesitas
Hubungan Perilaku Pola Makan dengan Kejadian Anak Obesitas
<p><em><span style="font-size: 11.0pt; font-family: 'Times New Roman',serif; mso-fareast-font-family: 'Times New Roman'; mso-ansi-language: EN-US; mso-fareast-langua...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Crescimento de feijoeiro sob influência de carvão vegetal e esterco bovino
Crescimento de feijoeiro sob influência de carvão vegetal e esterco bovino
<p align="justify"><span style="color: #000000;"><span style="font-family: 'Times New Roman', serif;"><span><span lang="pt-BR">É indiscutível a import...
Domination of polynomial with application
Domination of polynomial with application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
A Wideband mm-Wave Printed Dipole Antenna for 5G Applications
A Wideband mm-Wave Printed Dipole Antenna for 5G Applications
<span lang="EN-MY">In this paper, a wideband millimeter-wave (mm-Wave) printed dipole antenna is proposed to be used for fifth generation (5G) communications. The single elem...
Strong Equality of Perfect Roman and Weak Roman Domination in Trees
Strong Equality of Perfect Roman and Weak Roman Domination in Trees
Let G = ( V , E ) be a graph and f : V ⟶ { 0 , 1 , 2 } be a function. Given a vertex u with f ( u ) = 0 , if all neighbors of u have zero weights, then u is ...
Drawing compound digraphs and its application to an idea organizer (abstract)
Drawing compound digraphs and its application to an idea organizer (abstract)
An
upward
drawing of an acyclic digraph is a planar straight-line drawing with the additional requirement that all the edges flow in the same direction, e.g...
On the spectral radius of weighted digraphs
On the spectral radius of weighted digraphs
We consider the weighted digraphs in which the arc weights are positive definite matrices. We obtain some upper bounds for the spectral radius of these digraphs and characterize th...

