Results 1 to 10 of about 27,383 (219)
Signed total double Roman dominating functions in graphs
AKCE International Journal of Graphs and CombinatoricsA signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi +2 more
doaj +2 more sources
Bounds on signed total double Roman domination [PDF]
Communications in Combinatorics and Optimization, 2020 A signed total double Roman dominating function (STDRDF) on {an} isolated-free graph $G=(V,E)$ is a function $f:V(G)\rightarrow\{-1,1,2,3\}$ such that (i) every vertex $v$ with $f(v)=-1$ has at least two neighbors assigned 2 under $f$ or one neighbor ...
L. Shahbazi +3 more
doaj +1 more source
Signed total Roman $k$-domination in directed graphs
Communications in Combinatorics and Optimization, 2016 Let $D$ be a finite and simple digraph with vertex set $V(D)$. A signed total Roman $k$-dominating function (STR$k$DF) on $D$ is a function $f:V(D)\rightarrow\{-1, 1, 2\}$ satisfying the conditions that (i) $\sum_{x\in N^{-}(v)}f(x)\ge k ...
N. Dehgard, L. Volkmann
doaj +1 more source
Nationalism, Myth and Reinterpretation of History: The Neglected Case of Interwar Yugoslavia [PDF]
, 2012 This article discusses and challenges some popular myths and perceptions about interwar Yugoslavia in post-socialist (and post-Yugoslav) Serbia. These include discourses that blame ‘others’ – ‘treacherous’ Croats and other non-Serbs, the ‘perfidious ...
Djokic, Dejan
core +1 more source
Signed Total Roman Edge Domination In Graphs
Discussiones Mathematicae Graph Theory, 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 ...
Asgharsharghi Leila +1 more
doaj +1 more source
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
Nonnegative signed total Roman domination in graphs
Communications in Combinatorics and Optimization, 2020 Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)\rightarrow\{-1, 1, 2\}$ satisfying the conditions that (i) $\sum_{x\in N(v)}f(x)\ge 0$ for
Nasrin Dehgardi, Lutz Volkmann
doaj +1 more source
Signed Total Roman Domination in Digraphs
Discussiones Mathematicae Graph Theory, 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
doaj +1 more source
Complexity and coherence [PDF]
, 2012 Leslie Topp traces the emergence of the asylum mortuary as an architectural challenge. Drawing on new archival research, Complexity and Coherence: The Challenge of the Asylum Mortuary in Central Europe, 1898–1908 unpacks the highly fraught combination of
Topp, Leslie
core +1 more source
Versatile Digital GHz Phase Lock for External Cavity Diode Lasers
, 2009 We present a versatile, inexpensive and simple optical phase lock for applications in atomic physics experiments. Thanks to all-digital phase detection and implementation of beat frequency pre-scaling, the apparatus requires no microwave-range reference ...
Appel, Jürgen +2 more
core +1 more source