Zobrazeno 1 - 10
of 61
pro vyhledávání: '"italian domination number"'
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.
Publikováno v:
Computer Science Journal of Moldova, Vol 31, Iss 2(92), Pp 169-182 (2023)
Let $G$ be a graph with vertex set $V(G)$. An \textit{Italian dominating function} (IDF) on a graph $G$ is a function $f:V(G)\longrightarrow \{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ is adjacent to a vertex $u$ with $f(u)=2$ or to two vert
Externí odkaz:
https://doaj.org/article/8aad89f3134b4254a41be93cdb007bbd
Publikováno v:
AIMS Mathematics, Vol 8, Iss 5, Pp 10654-10664 (2023)
Let $ f:V(G)\rightarrow \{0, 1, 2\} $ be a function defined from a connected graph $ G $. Let $ W_i = \{x\in V(G): f(x) = i\} $ for every $ i\in \{0, 1, 2\} $. The function $ f $ is called a total Italian dominating function on $ G $ if $ \sum_{v\in
Externí odkaz:
https://doaj.org/article/1658ac6328f44e37bfec8d951caf6737
Autor:
Rouhollah Jalaei, Doost Ali Mojdeh
Publikováno v:
Theory and Applications of Graphs, Vol 10, Iss 1, Pp 1-13 (2023)
An outer independent double Italian dominating function on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ for which each vertex $x\in V(G)$ with $\color{red}{f(x)\in \{0,1\}}$ then $\sum_{y\in N[x]}f(y)\geqslant 3$ and vertices assigned $0$
Externí odkaz:
https://doaj.org/article/15cd189260894cca9402c79b5d5dddd5
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.
Autor:
Lutz Volkmann
Publikováno v:
Opuscula Mathematica, Vol 41, Iss 2, Pp 259-268 (2021)
Let \(G\) be a graph with vertex set \(V(G)\). If \(u\in V(G)\), then \(N[u]\) is the closed neighborhood of \(u\). An outer-independent double Italian dominating function (OIDIDF) on a graph \(G\) is a function \(f:V(G)\longrightarrow \{0,1,2,3\}\)
Externí odkaz:
https://doaj.org/article/ac866aa10a6c4a408316e8a73f58fc32
Publikováno v:
AIMS Mathematics, Vol 6, Iss 6, Pp 6490-6505 (2021)
The Italian reinforcement number of a digraph is the minimum number of arcs that have to be added to the digraph in order to decrease the Italian domination number. In this paper, we present some new sharp upper bounds on the Italian reinforcement nu
Externí odkaz:
https://doaj.org/article/6013d2c338da404e84e745e9b668fc42
Publikováno v:
Computer Science Journal of Moldova, Vol 27, Iss 2(80), Pp 204-229 (2019)
A signed Italian dominating function on a graph $G=(V,E)$ is a function $f:V\to \{ -1, 1, 2 \}$ satisfying the condition that for every vertex $u$, $f[u]\ge 1$. The weight of signed Italian dominating function is the value $f(V)=\sum_{u\in V}f(u)$. T
Externí odkaz:
https://doaj.org/article/b0113830cd5247cd8ee1a5a274702c96
Autor:
L.Volkmann
Publikováno v:
Communications in Combinatorics and Optimization, Vol 4, Iss 1, Pp 61-70 (2019)
An {\em Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function $f\colon V(D)\to \{0, 1, 2\}$ such that every vertex $v\in V(D)$ with $f(v)=0$ has at least two in-neighbors assigned 1 under $f$ or one in-neighb
Externí odkaz:
https://doaj.org/article/6de049dd20074930a508b4a4fe2f199f
Publikováno v:
IEEE Access, Vol 7, Pp 184448-184456 (2019)
An Italian dominating function (IDF) on a graph G = (V, E) is a function f:V → {0, 1, 2} satisfying the condition that for every vertex v ∈ V with f(v)=0, either v is adjacent to a vertex assigned 2 under f, or v is adjacent to at least two verti
Externí odkaz:
https://doaj.org/article/085f9f1e95fd4383ab6a9fe75097aa23