Results 21 to 30 of about 27,981 (268)
DOMINATION AND REGULARITY [PDF]
AbstractWe discuss the close relationship between structural theorems in (generalized) stability theory, and graph regularity theorems.
openaire +3 more sources
Domination Parameters of a Graph and its Complement
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G.
Desormeaux Wyatt J. +2 more
doaj +1 more source
Domination, eternal domination and clique covering
16 pages, 3 ...
William F. Klostermeyer +1 more
openaire +3 more sources
Iterated weak dominance and subgame dominance [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
Summary: For a finite undirected graph \(G\) on \(n\) vertices two continuous optimization problems taken over the \(n\)-dimensional cube are presented and it is proved that their optimum values equal the domination number \(\gamma\) of \(G\). An efficient approximation method is developed and known upper bounds on \(\gamma\) are slightly improved.
Frank Göring, Jochen Harant
openaire +2 more sources
On Independence Domination [PDF]
Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence domination for graphs in several graph classes related to cographs. We present an exact exponential algorithm.
Wing-Kai Hon +4 more
openaire +2 more sources
Objective: to revisit the debate about rational choice theory from the legal, cultural and historical perspectives.Methods: dialectic approach to the cognition of social phenomena, allowing to analyze them in their historical development and functioning in the context of the integrity of subjective and objective factors; this determines the choice of ...
openaire +2 more sources
Restrained roman domination in graphs [PDF]
A Roman dominating function (RDF) on a graph G = (V,E) is defined to be a function 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. A set S V is a Restrained dominating set if every
Roushini Leely Pushpam +1 more
doaj
Survey on Roman {2}-Domination
The notion of Roman {2}-domination was introduced in 2016 as a variant of Roman domination, a concept inspired by a defending strategy used by the emperor Constantine (272–337 AD) to protect the Roman Empire.
Ahlam Almulhim +2 more
doaj +1 more source
In Palantir we trust? Regulation of data analysis platforms in public security
Organizations increasingly rely on digital technologies to perform tasks. To do so, they have to integrate data banks to make the data usable. We argue that there is a growing, academically underexplored market consisting of data integration and analysis
Lena Ulbricht, Simon Egbert
doaj +1 more source

