Results 51 to 60 of about 123,660 (292)
Protecting a Graph with Mobile Guards [PDF]
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
Roman domination in direct product graphs and rooted product graphs
Let $ G $ be a graph with vertex set $ V(G) $. A function $ f:V(G)\rightarrow \{0, 1, 2\} $ is a Roman dominating function on $ G $ if every vertex $ v\in V(G) $ for which $ f(v) = 0 $ is adjacent to at least one vertex $ u\in V(G) $ such that $ f(u) = 2
Abel Cabrera Martínez +2 more
doaj +1 more source
The economic consequences of the spanish Reconquest: The long-term effects of medieval conquest and colonization [PDF]
This paper shows that a historical process that ended more than five centuries ago, the Reconquest, is very important to explain Spanish regional economic development down to the present day.
Oto-Peralias, Daniel +1 more
core +2 more sources
Analysis of the presence of Eastern elements in Frankenstien Mary Shelly [PDF]
1. Introduction The valuable Frankenstein or Modern Prometheus novel written by Mary Shelley in the early nineteenth century is a Gothic-style science-fiction.
Najmeh Dorri, Shabnam Amiri
doaj +1 more source
Total Protection of Lexicographic Product Graphs
Given a graph G with vertex set V (G), a function f : V (G) → {0, 1, 2} is said to be a total dominating function if Σu∈N(v) f(u) > 0 for every v ∈ V (G), where N(v) denotes the open neighbourhood of v. Let Vi = {x ∈ V (G) : f(x) = i}. A total dominating
Martínez Abel Cabrera +1 more
doaj +1 more source
Coloring, location and domination of corona graphs [PDF]
A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the vertices of a ...
Aguilar, A. Rondón +2 more
core +4 more sources
Must Realists Be Pessimists About Democracy? Responding to Epistemic and Oligarchic Challenges [PDF]
In this paper we show how a realistic normative democratic theory can work within the constraints set by the most pessimistic empirical results about voting behaviour and elite capture of the policy process.
Arlen, Gordon, Rossi, Enzo
core +2 more sources
Protection of Lexicographic Product Graphs
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 bondage number in graphs
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
Quasi-total Roman reinforcement in graphs
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

