Results 21 to 30 of about 1,131,018 (144)
Bounds for signed double Roman k-domination in trees
RAIRO - Operations Research, 2019 Let k ≥ 1 be an integer and G be a simple and finite graph with vertex set V(G). A signed double Roman k-dominating function (SDRkDF) on a graph G is a function f:V(G) → {−1,1,2,3} such that (i) every vertex v with f(v) = −1 is adjacent to at least two ...
Xiaosong Zhang +6 more
core +2 more sources
CoRR, 2022 In this paper we deal with the signed Roman domination and signed total Roman domination problems. For each problem we propose two integer linear programming (ILP) formulations, the constraint programming (CP) formulation and variable neighborhood search (VNS) method.
Vladimir Filipovic +2 more
openaire +2 more sources
Singed Total Domatic Number of a Graph [PDF]
, 2010 The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol +2 more
core +1 more source
Product Signed Domination in Graphs [PDF]
, 2022 Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a product signed dominating function, if for every vertex where . The weight of , denoted by , is the sum of the function values of all the vertices in . .
Nagarajan, A, Palani, K, Velammal, T M
core +1 more source
SIGNED 2-DOMINATION IN CATERPILLARS [PDF]
, 2003 summary:A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a simple path is obtained. The signed 2-domination number $\gamma ^2_{\mathrm s}(G)$ and the signed total 2-domination number $\gamma ^2_{\mathrm {st}}(G)$
Zelinka, Bohdan, Bohdan Zelinka
core +1 more source
Signed and minus domination in bipartite graphs [PDF]
, 2006 summary:The paper studies the signed domination number and the minus domination number of the complete bipartite graph $K_{p, q}$
Zelinka, Bohdan
core +1 more source
Signed domination numbers of directed graphs [PDF]
, 2005 summary:The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater) is transferred to directed graphs. Exact values are found for particular types of tournaments.
Zelinka, Bohdan
core +1 more source
Signed Roman Domination Number and Join of Graphs
, 2014 In this paper we determine the signed Roman domination number of the join of cycles, wheels, fans and friendship graphs.
Behtoei, A. +2 more
openaire +3 more sources
The Signed Total Roman k-Domatic Number Of A Graph
Discussiones Mathematicae Graph Theory, 2017 Let k ≥ 1 be an integer. A signed total Roman k-dominating function on a graph G is a function f : V (G) → {−1, 1, 2} such that Ʃu2N(v) f(u) ≥ k for every v ∈ V (G), where N(v) is the neighborhood of v, and every vertex u ∈ V (G) for which f(u) = −1 is ...
Volkmann Lutz
doaj +1 more source
Complexity of signed total $k$-Roman domination problem in graphs
AIMS Mathematics, 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 vertex $t$ with $f(t) = 2, $ (ii) $\sum_{t\in N(y)}f(t)\geq k$ holds for any vertex $y$.
Saeed Kosari +4 more
openaire +3 more sources