Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Jafar Amjadi"'
Autor:
Jafar Amjadi, Hakimeh Sadeghi
Publikováno v:
Computer Science Journal of Moldova, Vol 30, Iss 1(88), Pp 109-130 (2022)
For a graph $G=(V, E)$, a triple Roman domination function is a function $f: V(G)\longrightarrow\{0, 1, 2, 3, 4\}$ having the property that for any vertex $v\in V(G)$, if $f(v)
Externí odkaz:
https://doaj.org/article/79762a59ce0244038ac682d2f8df44c5
Publikováno v:
AIMS Mathematics, Vol 6, Iss 1, Pp 952-961 (2021)
Let $G$ be a simple graph with finite vertex set $V(G)$ and $S=\{-1,1,2\}$. A signed total Roman $k$-dominating function (STRkDF) on a graph $G$ is a function $f:V(G)\to S$ such that (i) any vertex $y$ with $f(y)=-1$ is adjacent to at least one verte
Externí odkaz:
https://doaj.org/article/54b7b8ea339c4d36a7511caaad284fbd
Publikováno v:
Theory and Applications of Graphs, Vol 9, Iss 2 (2022)
A set $S$ of vertices is a restrained dominating set of a graph $G=(V,E)$ if every vertex in $V\setminus S$ has a neighbor in $S$ and a neighbor in $V\setminus S$. The minimum cardinality of a restrained dominating set is the restrained domination nu
Externí odkaz:
https://doaj.org/article/520c2c19d7d14a39b9d8de4019d5ed16
Publikováno v:
IEEE Access, Vol 7, Pp 52035-52041 (2019)
Let G = (V, E) be a simple graph. A double Roman dominating function (DRDF) on G is a function f from the vertex set V of G into {0, 1, 2, 3} such that if f (u) = 0, then u must have at least two neighbors assigned 2 or one neighbor assigned 3 under
Externí odkaz:
https://doaj.org/article/6930ad703ebc41d68993d583ee283603
Publikováno v:
Symmetry, Vol 13, Iss 8, p 1318 (2021)
This paper is devoted to the study of the quadruple Roman domination in trees, and it is a contribution to the Special Issue “Theoretical computer science and discrete mathematics” of Symmetry. For any positive integer k, a [k]-Roman dominating f
Externí odkaz:
https://doaj.org/article/05a8e1711ce540ac934010867ef42ae6
Publikováno v:
Mathematics, Vol 7, Iss 2, p 203 (2019)
Let k be a positive integer, and set [ k ] : = { 1 , 2 , … , k } . For a graph G, a k-rainbow dominating function (or kRDF) of G is a mapping f : V ( G ) → 2 [ k ] in such a way that, for any vertex v ∈ V ( G ) with the empty set under f, the c
Externí odkaz:
https://doaj.org/article/7f0e6922348748598632b9d435631a6c
Publikováno v:
Transactions on Combinatorics, Vol 2, Iss 4, Pp 1-12 (2013)
A {em Roman dominating function} on a graph $G = (V ,E)$ is a function $f : Vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. The {em weight}
Externí odkaz:
https://doaj.org/article/a969902d590944daac2461adb909ac03
Publikováno v:
RAIRO - Operations Research. 57:371-382
An independent Roman dominating function (IRD-function) on a graph G is a function f : V(G) → {0, 1, 2} satisfying the conditions that (i) every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2, and (ii) the set o
Publikováno v:
Polycyclic Aromatic Compounds. :1-9
Publikováno v:
Polycyclic Aromatic Compounds. :1-9