Zobrazeno 1 - 10
of 281
pro vyhledávání: '"{K}-DOMINATING FUNCTION"'
Autor:
Volkmann, Lutz1 volkm@math2.rwth-aachen.de
Publikováno v:
Opuscula Mathematica. 2024, Vol. 44 Issue 2, p285-296. 12p.
Autor:
Klostermeyer, William F.1 (AUTHOR) wkloster@unf.edu, MacGillivray, Gary1,2 (AUTHOR) gmacgill@uvic.ca, Semnani, Saeed Mohammadian3 (AUTHOR) s_mohammadian@semnan.ac.ir, Piri, Farzaneh3 (AUTHOR) f.piri@semnan.ac.ir
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2023, Vol. 43 Issue 1, p115-135. 21p.
Autor:
Lutz Volkmann
Publikováno v:
Opuscula Mathematica, Vol 44, Iss 2, Pp 285-296 (2024)
Let \(k\geq 1\) be an integer, and let \(D\) be a finite and simple digraph with vertex set \(V(D)\). A weak signed Roman \(k\)-dominating function (WSRkDF) on a digraph \(D\) is a function \(f \colon V(D)\rightarrow \{-1,1,2\}\) satisfying the condi
Externí odkaz:
https://doaj.org/article/fbea9ae4603849dea666fa19227275ef
Autor:
Volkmann, Lutz1 volkm@math2.rwth-aachen.de
Publikováno v:
Communications in Combinatorics & Optimization. Winter/Spring2022, Vol. 7 Issue 1, p17-27. 11p.
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
Autor:
VOLKMANN, LUTZ1 volkm@math2.rwth-aachen.de
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2017, Vol. 37 Issue 4, p1027-1038. 12p.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 1, Pp 67-79 (2019)
Let k be a positive integer. A signed Roman k-dominating function (SRkDF) on a digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) Σx∈N−[v]f(x) ≥ k for each v ∈ V (D), where N−[v] is the closed in-neighbor
Externí odkaz:
https://doaj.org/article/0c70d0535d794c4fa357d9a2506a6de3
Autor:
L. Volkmann
Publikováno v:
Communications in Combinatorics and Optimization, Vol 3, Iss 2, Pp 173-178 (2018)
Let $G$ be a graph with vertex set $V(G)$. For any integer $k\ge 1$, a signed (total) $k$-dominating function is a function $f: V(G) \rightarrow \{ -1, 1\}$ satisfying $\sum_{x\in N[v]}f(x)\ge k$ ($\sum_{x\in N(v)}f(x)\
Externí odkaz:
https://doaj.org/article/70529953f3554966ae89fb20085f2cc3
Autor:
Aram, H.1, Sheikholeslami, S. M.1 s.m.sheikholeslami@azaruniv.edu, Volkmann, L.2 volkm@math2.rwth-aachen.de
Publikováno v:
Acta Mathematica Universitatis Comenianae. 2012, Vol. 81 Issue 1, p9-14. 6p.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 1, Pp 39-53 (2017)
Let k ≥ 1 be an integer, and G = (V, E) be a finite and simple graph. The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and all edges having a common end-vertex with e. A signed Roman edge k-dominating function (SRE
Externí odkaz:
https://doaj.org/article/df4852dc8318467293ed59ddce985c42