Results 51 to 60 of about 273,507 (170)
The compared costs of domination, location-domination and identification
Let \(G\) be a graph and \(\{u\in V(G):d_G(u,v)\leq r\}\) is a ball of radius \(r\in\mathbb{N}\) centered at \(v\in V(G)\) and denoted by \(B_r(v)\). We say that \(x,y\in V(G)\) are \(r\)-twins if \(B_r(x)=B_r(y)\). A set \(D_1\subseteq V(G)\) is an \(r\)-dominating code of \(G\) if \(D_1\cap B_r(v)\neq\emptyset\) for every \(v\in V(G)\).
Hudry Olivier, Lobstein Antoine
openaire +2 more sources
Domination and upper domination of direct product graphs [PDF]
16 pages, 1 ...
Colin Defant, Sumun Iyer
openaire +2 more sources
Adaptation to contrasting environments occurs when advantageous alleles accumulate in each population, but it remains largely unknown whether these same advantageous alleles create genetic incompatibilities that can cause intrinsic reproductive isolation
Greg M. Walter +5 more
doaj +1 more source
Distance domination versus iterated domination
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gábor Bacsó, Zsolt Tuza
openaire +1 more source
Ants are one of the most widespread groups of insects, but the mechanisms allowing them to coexist despite having similar nutritional needs remain unclear.
Marie Bourel +4 more
doaj +1 more source
On the out-domination and in-domination numbers of a digraph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gary Chartrand +2 more
openaire +1 more source
Total domination and least domination in a tree
A subset \(X\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating (or total dominating) in \(G\), if for each \(x\in V(G)- X\) (or for each \(x\in V(G)\), respectively) there exists \(y\in X\) adjacent to \(x\). The least number of vertices of a dominating (or total dominating) set in \(G\) is the domination number \(\gamma(G)\) (or the ...
Xuezheng Lv, Jingzhong Mao
openaire +1 more source
Generalized domination and efficient domination in graphs
The closed neighbourhood of a vertex \(v\) of a graph \(G\) is the set consisting of \(v\) and of all vertices adjacent to \(v\) in \(G\). A function \(f\) which maps the vertex set \(V(G)\) of \(G\) onto a subset \(Y\) of the set of real numbers is called \(Y\)-dominating in \(G\), if the sum of its values over the closed neighbourhood of each vertex \
David W. Bange +3 more
openaire +2 more sources
Species richness, composition, and dominance of core and climate relicts of African miombo woodlands
The miombo woodlands, which span about 10% of the African continent, are essential for the ecosystem services they provide. These woodlands are mainly dominated by the genera Julbernardia, Isoberlinia, and Brachystegia.
Brenden Pienaar +3 more
doaj +1 more source
Domination versus disjunctive domination in trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning, Sinclair A. Marcon
openaire +2 more sources

