Zobrazeno 1 - 10
of 318
pro vyhledávání: '"Ahangar H"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 3, Pp 937-958 (2022)
A Roman {2}-dominating function (R2F) is a function f : V → {0, 1, 2} with the property that for every vertex v ∈ 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. A total Roman {
Externí odkaz:
https://doaj.org/article/1724ad0e9f1643f88b1bc811866fabb6
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 2, Pp 345-360 (2021)
A 2-rainbow dominating function (2RDF) of a graph G = (V (G), E(G)) is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2} such that for every vertex v ∈ V (G) with f(v) = ∅ the condition ∪u∈N(v)f(u) = {1, 2} is
Externí odkaz:
https://doaj.org/article/2692cb4050404d7d800eb96ce64718fb
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 4, Pp 787-803 (2019)
A total Roman dominating function on a graph G is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2 and the subgraph of G induced by the set of all vertices of positive weight has no isolated vertex. T
Externí odkaz:
https://doaj.org/article/85a7a98bad8f41ce9a84b94299988a59
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
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
Publikováno v:
Journal of the European Optical Society-Rapid Publications, Vol 7, p 12022 (2012)
The pulsed laser thermal lens technique was used to study the thermal diffusivity of fluids containing copper nanoparticles (Cu-NPs) prepared by γ-irradiation method. The samples were prepared for the different concentrations of Cu precursor at 20.K
Externí odkaz:
https://doaj.org/article/303a710b1b6444a3a07aaa9669ea4724
Autor:
Samadi, B., Soltankhah, N., Abdollahzadeh Ahangar, H., Chellali, M., Mojdeh, D.A., Sheikholeslami, S.M., Valenzuela-Tripodoro, J.C.
Publikováno v:
In Applied Mathematics and Computation 1 February 2023 438
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.