Results 11 to 20 of about 8,869,670 (146)
Signed double Roman domination on cubic graphs [PDF]
, 2023 The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from $\{\pm{}1,2,3\}$ to each vertex feasibly, such that the total sum of assigned labels is minimized.
Iurlano, Enrico +3 more
core +3 more sources
Theoretical results for Perfect Location signed Roman domination problem [PDF]
The study of Roman domination has evolved to encompass a variety of challenging extensions, each contributing to the broader understanding of domination problems in graph theory.
Nikolić, Bojan +2 more
core +9 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
Double Roman and double Italian domination [PDF]
, 2023 Let $G$ be a graph with vertex set $V(G)$. A double Roman dominating function (DRDF) on a graph $G$ is a function \( f:V(G)\longrightarrow\{0,1,2,3\} \) that satisfies the following conditions: (i) If $f(v)=0$, then $v$ must have a neighbor $w$ with $f(w)
Volkmann, Lutz, Lutz Volkmann
core +1 more source
Signed Total Roman Domination in Digraphs [PDF]
, 2017 Let D be a finite and simple digraph with vertex set V (D). A signed total Roman dominating function (STRDF) on a digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑x∈N−(v)f(x) ≥ 1 for each v ∈ V (D), where N−(v) consists ...
Volkmann Lutz, Volkmann, Lutz
core +1 more source
Signed Total Roman Edge Domination In Graphs [PDF]
, 2017 Let G = (V,E) be a simple graph with vertex set V and edge set E. A signed total Roman edge dominating function of G is a function f : Ʃ → {−1, 1, 2} satisfying the conditions that (i) Ʃe′∈N(e) f(e′) ≥ 1 for each e ∈ E, where N(e) is the open ...
Sheikholeslami, Seyed Mahmoud +5 more
core +1 more source
On signed majority total domination in graphs [PDF]
, 2005 summary:We initiate the study of signed majority total domination in graphs. Let $G=(V,E)$ be a simple graph. For any real valued function $f\: V \rightarrow \mathbb{R}$ and ${S\subseteq V}$, let $f(S)=\sum _{v\in S}f(v)$.
Sun, Liang +2 more
core +1 more source
A note on the double Roman domination number of graphs [PDF]
, 2020 summary:For a graph $G=(V,E)$, a double Roman dominating function is a function $f\colon V\rightarrow \{0,1,2,3\}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least two neighbors assigned $2$ under $f$ or one neighbor with $f(w)
Chen, Xue-Gang
core +1 more source
Total Minimal Dominating Signed Graph [PDF]
, 2010 Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
Signed Roman Edge k-Domination in Graphs [PDF]
, 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.
Volkmann Lutz +2 more
core +2 more sources