Results 21 to 30 of about 151,596 (298)
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
Triple Connected Domination Number of a Graph [PDF]
, 2012 The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan +7 more
core +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 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
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
, 2003 We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source
DOMINATION AND REGULARITY [PDF]
The Bulletin of Symbolic Logic, 2020 AbstractWe discuss the close relationship between structural theorems in (generalized) stability theory, and graph regularity theorems.
openaire +3 more sources
Domination in functigraphs [PDF]
Discussiones Mathematicae Graph Theory, 2012 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
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.
Michael A. Henning +2 more
openaire +4 more sources
Secrétaires et policiers ? Les assistant·es d’éducation et leurs appropriations d’un travail dominé
La Nouvelle Revue du Travail, 2022 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
Hereditary equality of domination and exponential domination
Discussiones Mathematicae Graph Theory, 2018 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
Product throttling for power domination [PDF]
, 2023 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