Zobrazeno 1 - 10
of 264
pro vyhledávání: '"Sheikholeslami, S. M."'
Publikováno v:
Discussiones Mathematicae Graph Theory 42 (2022) 937-958
A Roman $\{2\}$-dominating function (R2F) is a function $f:V\rightarrow \{0,1,2\}$ with the property that for every vertex $v\in V$ with $f(v)=0$ there is a neighbor $u$ of $v$ with $f(u)=2$, or there are two neighbors $x,y$ of $v$ with $f(x)=f(y)=1$
Externí odkaz:
http://arxiv.org/abs/2402.07968
Publikováno v:
Mediterranean Journal of Mathematics (2023) 20:171
Let $\{0,1,\dots, t\}$ be abbreviated by $[t].$ A double Roman dominating function (DRDF) on a graph $\Gamma=(V,E)$ is a map $l:V\rightarrow [3]$ satisfying \textrm{(i)} if $l(r)=0$ then there must be at least two neighbors labeled 2 under $l$ or a n
Externí odkaz:
http://arxiv.org/abs/2402.07020
Publikováno v:
Applied Mathematics and Computation 414 (2022) 126662
A maximal double Roman dominating function (MDRDF) on a graph $G=(V,E)$ is a function $f:V(G)\rightarrow \{0,1,2,3\}$ such that \textrm{(i) }every vertex $v$ with $f(v)=0$ is adjacent to least two vertices { assigned $2$ or to at least one vertex ass
Externí odkaz:
http://arxiv.org/abs/2402.07013
Let $G=(V,E)$ be a graph of order $n$ and let $\gamma _{R}(G)$ and $\partial (G)$ denote the Roman domination number and the differential of $G,$ respectively. In this paper we prove that for any integer $k\geq 0$, if $G$ is a graph of order $n\geq 6
Externí odkaz:
http://arxiv.org/abs/2110.07709
Autor:
Samadi, Babak, Soltankhah, Nasrin, Ahangar, H. Abdollahzadeh, Chellali, M., Mojdeh, Doost Ali, Sheikholeslami, S. M., Valenzuela-Tripodoro, J. C.
Publikováno v:
Applied Mathematics and Computation, 2023
We continue the study of restrained double Roman domination in graphs. For a graph $G=\big{(}V(G),E(G)\big{)}$, a double Roman dominating function $f$ is called a restrained double Roman dominating function (RDRD function) if the subgraph induced by
Externí odkaz:
http://arxiv.org/abs/2109.06666
The forgotten topological index of a graph $G$, denoted by $F(G)$, is defined as the sum of weights $d(u)^{2}+d(v)^{2}$ over all edges $uv$ of $G$ , where $d(u)$ denotes the degree of a vertex $u$. In this paper, we give sharp upper bounds of the F-i
Externí odkaz:
http://arxiv.org/abs/2102.02415
Let $k$ be a positive integer. A {\em Roman $k$-dominating function} on a graph $G$ is a labeling $f:V (G)\longrightarrow \{0, 1, 2\}$ such that every vertex with label 0 has at least $k$ neighbors with label 2. A set $\{f_1,f_2,\ldots,f_d\}$ of dist
Externí odkaz:
http://arxiv.org/abs/2003.09272
Consider a finite and simple graph $G=(V,E)$ with maximum degree $\Delta$. A strong Roman dominating function over the graph $G$ is understood as a map $f : V (G)\rightarrow \{0, 1,\ldots , \left\lceil \frac{\Delta}{2}\right\rceil+ 1\}$ which carries
Externí odkaz:
http://arxiv.org/abs/1912.01093
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.