Results 41 to 50 of about 98,039 (260)
Hyper-power and private monopoly: the unholy marriage of (neo) corporatism and the imperial surveillance state [PDF]
, 2014 American hyper-power world dominance by public and private agencies has replaced British Empire hyper-power world domination in the period 1815-1914.
Marsden, Chris
core +1 more source
Total Roman domination in graphs
Applicable Analysis and Discrete Mathematics, 2016 A Roman dominating function on a graph G is a function f:V(G) → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of a Roman dominating function f is the sum, ΣuV(G) f(u), of the weights of the vertices.
Hossein Ahangar Abdollahzadeh +3 more
openaire +2 more sources
Quasi-total Roman bondage number in graphs
AKCE International Journal of Graphs and Combinatorics, 2022 A quasi-total Roman dominating function (QTRD-function) on [Formula: see text] is a function [Formula: see text] such that (i) every vertex x for which f(x) = 0 is adjacent to at least one vertex v for which f(v) = 2, and (ii) if x is an isolated vertex ...
Huiqin Jiang, Zehui Shao
doaj +1 more source
Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 In this paper, we study the weak Roman domination number and the secure domination number of lexicographic product graphs. In particular, we show that these two parameters coincide for almost all lexicographic product graphs. Furthermore, we obtain tight
Klein Douglas J. +1 more
doaj +1 more source
Quasi-total Roman reinforcement in graphs
AKCE International Journal of Graphs and Combinatorics, 2023 A quasi-total Roman dominating function (QTRD-function) on [Formula: see text] is a function [Formula: see text] such that (i) every vertex x for which f(x) = 0 is adjacent to at least one vertex v for which f(v) = 2, and (ii) if x is an isolated vertex ...
N. Ebrahimi +3 more
doaj +1 more source
Total Roman {3}-Domination: The Complexity and Linear-Time Algorithm for Trees
Mathematics, 2021 For a simple graph G=(V,E) with no isolated vertices, a total Roman {3}-dominating function(TR3DF) on G is a function f:V(G)→{0,1,2,3} having the property that (i) ∑w∈N(v)f(w)≥3 if f(v)=0; (ii) ∑w∈N(v)f(w)≥2 if f(v)=1; and (iii) every vertex v with f(v ...
Xinyue Liu +3 more
doaj +1 more source
Protecting a Graph with Mobile Guards [PDF]
, 2015 Mobile guards on the vertices of a graph are used to defend it against attacks on either its vertices or its edges. Various models for this problem have been proposed.
Klostermeyer, William F. +1 more
core +1 more source
Angewandte Chemie, EarlyView.Homochiral Cu(I) cyanide complexes based on 2,2’‐bis(diphenylphosphino)‐1,1’‐binaphthyl (BINAP) form melt‐quenched and desolvation‐derived metal–organic glasses that exhibit circularly polarized thermally activated delayed fluorescence (TADF) at room temperature, enabling processable chiroptical materials.
Zeyu Fan +5 more
wiley +2 more sources
Delenda est haec Carthago: the Ostend company as a problem of European great power politics (1722-1727) [PDF]
, 2015 The Ostend Company (1722-1731) is a symbol of present-day Belgium’s strangling by European Great Power politics in the Ancien Régime, and more specifically of the limitations imposed on the Southern Netherlands by the Dutch Republic in 1648.
Dhondt, Frederik
core +3 more sources
On the Total Version of Triple Roman Domination in Graphs
MathematicsIn this paper, we describe the study of total triple Roman domination. Total triple Roman domination is an assignment of labels from {0,1,2,3,4} to the vertices of a graph such that every vertex is protected by at least three units either on itself or ...
Juan Carlos Valenzuela-Tripodoro +3 more
doaj +1 more source