Results 21 to 30 of about 681,927 (350)
A Greedy Partition Lemma for Directed Domination [PDF]
, 2010 A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V(D) \setminus S$ has an adjacent vertex $v$ in $S$ with $v$ directed to $u$.
Caro, Yair, Henning, Michael A.
core +2 more sources
An Imperfect Firewall: Quebec’s Constitutional Right of Secession as a Device Against Domination
Politics and Governance, 2021 The idea of including a right of secession in democratic constitutions has been discussed by different political and legal theorists; however, little has been said on the matter from the point of view of democratic-republican political philosophy.
Lluís Pérez-Lozano
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 Imagine that we are given a set $D$ of officials and a set $W$ of civils. For each civil $x \in W$, there must be an official $v \in D$ that can serve $x$, and whenever any such $v$ is serving $x$, there must also be another civil $w \in W$ that observes $v$, that is, $w$ may act as a kind of witness, to avoid any abuse from $v$.
Magda Dettlaff +4 more
openaire +3 more sources
Hypo-efficient domination and hypo-unique domination
Communications in Combinatorics and Optimization, 2016 For a graph $G$ let $\gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$\mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by ...
V. Samodivkin
doaj +1 more source
Relating domination, exponential domination, and porous exponential domination
Discrete Optimization, 2017 The domination number $ (G)$ of a graph $G$, its exponential domination number $ _e(G)$, and its porous exponential domination number $ _e^*(G)$ satisfy $ _e^*(G)\leq _e(G)\leq (G)$. We contribute results about the gaps in these inequalities as well as the graphs for which some of the inequalities hold with equality.
Dieter Rautenbach +2 more
openaire +3 more sources
The domination number of on-line social networks and random geometric graphs [PDF]
, 2014 We consider the domination number for on-line social networks, both in a stochastic network model, and for real-world, networked data. Asymptotic sublinear bounds are rigorously derived for the domination number of graphs generated by the memoryless ...
Bonato, Anthony +4 more
core +4 more sources
A note on global alliances in trees [PDF]
Opuscula Mathematica, 2011 For a graph \(G=(V,E)\), a set \(S\subseteq V\) is a dominating set if every vertex in \(V-S\) has at least a neighbor in \(S\). A dominating set \(S\) is a global offensive (respectively, defensive) alliance if for each vertex in \(V-S\) (respectively ...
Mohamed Bouzefrane, Mustapha Chellali
doaj +1 more source
Self-resonance after inflation: Oscillons, transients, and radiation domination [PDF]
, 2017 Homogeneous oscillations of the inflaton after inflation can be unstable to small spatial perturbations even without coupling to other fields. We show that for inflaton potentials $\ensuremath{\propto}|\ensuremath{\phi}{|}^{2n}$ near $|\ensuremath{\phi}|=
K. Lozanov, M. Amin
semanticscholar +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
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