Results 31 to 40 of about 151,596 (298)
Domination Parameters of a Graph and its Complement
Discussiones Mathematicae Graph Theory, 2018 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
Le libéralisme, combien de divisions ?
Astérion, 2022 Liberalism is a very broad political family which, if taken in the broadest sense, brings together authors with diverse positions whose only common point is their attachment to freedom.
Bernard Quiriny
doaj +1 more source
Product throttling for power domination [PDF]
, 2020 The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number.
Trenk, Ann +6 more
core
Iterated weak dominance and subgame dominance [PDF]
Journal of Mathematical Economics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
Distances and Domination in Graphs [PDF]
, 2020 This book presents a compendium of the 10 articles published in the recent Special Issue “Distance and Domination in Graphs”. The works appearing herein deal with several topics on graph theory that relate to the metric and dominating properties of ...
core +1 more source
Restrained roman domination in graphs [PDF]
Transactions on Combinatorics, 2015 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
On Independence Domination [PDF]
, 2013 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 +4 more sources
Survey on Roman {2}-Domination
MathematicsThe 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
Big Data & SocietyOrganizations 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
Actual Problems of Economics and Law, 2015 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