Results 1 to 10 of about 64,106 (202)

Independent double Roman domination in graphs [PDF]

AKCE International Journal of Graphs and Combinatorics, 2020
For a graph G = (V,E), a double Roman dominating function has the property that for every vertex with f(v) = 0, either there exists a vertex , with f(u) = 3, or at least two neighbors having f(x) = f(y) = 2, and every vertex with value 1 under f has at ...
H. R. Maimani, M. Momeni, F. Rahimi Mahid, S. M. Sheikholeslami   +3 more
doaj   +3 more sources

On the Outer-Independent Double Roman Domination of Graphs [PDF]

Frontiers in Applied Mathematics and Statistics, 2021
An outer-independent double Roman dominating function (OIDRDF) of a graph G is a function h:V(G)→{0,1,2,3} such that i) every vertex v with f(v)=0 is adjacent to at least one vertex with label 3 or to at least two vertices with label 2, ii) every vertex ...
Yongsheng Rao, Saeed Kosari, Seyed Mahmoud Sheikholeslami, M. Chellali, Mahla Kheibari   +4 more
doaj   +3 more sources

An improved upper bound on the independent double Roman domination number of trees [PDF]

AKCE International Journal of Graphs and Combinatorics, 2022
For a graph [Formula: see text] an independent double Roman dominating function (IDRDF) is a function [Formula: see text] having the property that: (i) every vertex [Formula: see text] with f(v) = 0 has a neighbor u with f(u) = 3 or at least two ...
F. Nahani Pour, H. Abdollahzadeh Ahangar, M. Chellali, S. M. Sheikholeslami   +3 more
doaj   +3 more sources

On Two Outer Independent Roman Domination Related Parameters in Torus Graphs

Mathematics, 2022
In a graph G=(V,E), where every vertex is assigned 0, 1 or 2, f is an assignment such that every vertex assigned 0 has at least one neighbor assigned 2 and all vertices labeled by 0 are independent, then f is called an outer independent Roman dominating ...
Hong Gao, Xing Liu, Yuanyuan Guo, Yuansheng Yang   +3 more
doaj   +3 more sources

On the Outer Independent Double Roman Domination Number [PDF]

Bulletin of the Iranian Mathematical Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doost Ali Mojdeh, Babak Samadi, Zehui Shao, Ismael G. Yero   +3 more
  +7 more sources

On the Outer Independent Total Double Roman Domination in Graphs [PDF]

Mediterranean Journal of Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdollahzadeh Ahangar, H., Chellali, Mustapha, Sheikholeslami, Seyed Mahmoud, Valenzuela Tripodoro, Juan Carlos   +3 more
openaire   +4 more sources

Lower and upper bounds on independent double Roman domination in trees [PDF]

Electronic Journal of Graph Theory and Applications, 2022
Summary: For a graph \(G = (V, E)\), a double Roman dominating function (DRDF) \(f : V \rightarrow \{0, 1, 2, 3\}\) has the property that for every vertex \(v\in V\) with \(f(v)=0\), either there exists a neighbor \(u \in N(v)\), with \(f(u)=3\), or at least two neighbors \(x, y \in N(v)\) having \(f(x)=f(y)=2\), and every vertex with value 1 under \(f\
Kheibari, M., Ahangar, Hossein Abdollahzadeh, Khoeilar, R., Sheikholeslami, S. M.   +3 more
openaire   +3 more sources

On the Independent Double Roman Domination in Graphs [PDF]

Bulletin of the Iranian Mathematical Society, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doost Ali Mojdeh, Zhila Mansouri
openaire   +4 more sources

Independent Double Roman Domination on Block Graphs [PDF]

, 2019
Given a graph $G=(V,E)$, $f:V \rightarrow \{0,1,2 \}$ is the Italian dominating function of $G$ if $f$ satisfies $\sum_{u \in N(v)}f(u) \geq 2$ when $f(v)=0$. Denote $w(f)=\sum_{v \in V}f(v)$ as the weight of $f$. Let $V_i=\{v:f(v)=i\},i=0,1,2$, we call $f$ the independent Italian dominating function if $V_1 \cup V_2$ is an independent set.
Wei, Decheng, Lu, Changhong
openaire   +3 more sources

Outer Independent Double Roman Domination Stability in Graphs [PDF]

Ars Combinatoria
An outer independent double Roman dominating function (OIDRDF) on a graph G is a function f : V ( G ) → { 0 , 1 , 2 , 3 } having the property that (i) if f ( v ) = 0 , then the vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f ( w ) = 3 , and if f ( v ) = 1 , then the vertex v must have at least one ...
Sheikholeslami, S. M., Esmaeili, M., Volkmann, L.   +2 more
openaire   +3 more sources