Results 31 to 40 of about 738,356 (324)
Domination in functigraphs [PDF]
Let $G_1$ and $G_2$ be disjoint copies of a graph $G$, and let $f: V(G_1) \rightarrow V(G_2)$ be a function. Then a \emph{functigraph} $C(G, f)=(V, E)$ has the vertex set $V=V(G_1) \cup V(G_2)$ and the edge set $E=E(G_1) \cup E(G_2) \cup \{uv \mid u \in V(G_1), v \in V(G_2), v=f(u)\}$.
Linda Eroh +4 more
openaire +3 more sources
Hypo-efficient domination and hypo-unique domination
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
Let be a graph and let be a family of subsets of such that A dominating set of is called an -dominating set if for all The minimum cardinality of an -dominating of is called the -domination number of and is denoted by In this paper we present several ...
Manju Raju +3 more
doaj +1 more source
Mill and Pettit on Freedom, Domination, and Freedom-as-Domination [PDF]
Pettit endorses a ‘republican’ conception of social freedom of the person as consisting of a state of non-domination, and takes this to refute Mill’s ‘liberal’ claim that non-domineering but coercive interference can compromise social freedom of choice ...
Beaumont, Tim
core +2 more sources
The domination number of on-line social networks and random geometric graphs [PDF]
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
Secrétaires et policiers ? Les assistant·es d’éducation et leurs appropriations d’un travail dominé
The article highlights the dominated position that French secondary school supervisors assume in the division of educational work. It does this by analysing the content of their tasks as well as the different ways in which they appropriate it ...
Géraldine Bois, Rémi Deslyper
doaj +1 more source
Relating domination, exponential domination, and porous exponential domination
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.
Michael A. Henning +2 more
openaire +3 more sources
DOMINATION AND REGULARITY [PDF]
AbstractWe discuss the close relationship between structural theorems in (generalized) stability theory, and graph regularity theorems.
openaire +3 more sources
Le libéralisme, combien de divisions ?
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
Hereditary equality of domination and exponential domination
We characterize a large subclass of the class of those graphs $G$ for which the exponential domination number of $H$ equals the domination number of $H$ for every induced subgraph $H$ of $G$.
Michael A. Henning +2 more
openaire +4 more sources

