Results 71 to 80 of about 151,596 (298)
Signed and minus domination in bipartite graphs [PDF]
, 2006 summary:The paper studies the signed domination number and the minus domination number of the complete bipartite graph $K_{p, q}$
Zelinka, Bohdan
core +2 more sources
The Analysis of Reproduction of Gender Language in Persian Popular Magazines in Iran (Magazines Published during the Year 1386) [PDF]
زن در فرهنگ و هنر, 2010 The distinguished gender language of the dominant gender discourse in the social atmosphere of Iran, as one of the most influential phenomenon determining the linguistic and non-linguistic actions of individuals, has been appeared in the popular ...
GHorban Ali Ebrahimi, Hasan Nasehi
doaj
Domination versus disjunctive domination in trees
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning, Sinclair A. Marcon
openaire +3 more sources
The compared costs of domination, location-domination and identification
Discussiones Mathematicae Graph Theory, 2020 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
Weakly connected domination stable trees [PDF]
, 1983 summary:A dominating set $D\subseteq V(G)$ is a {\it weakly connected dominating set} in $G$ if the subgraph $G[D]_w=(N_G[D],E_w)$ weakly induced by $D$ is connected, where $E_w$ is the set of all edges having at least one vertex in $D$.
Lemańska, Magdalena +5 more
core +1 more source
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
A linear time algorithm to compute vertices that belong to all, some and no minimum dominating sets in a tree and its consequences [PDF]
Opuscula MathematicaWe provide a linear time algorithm for determining the sets of vertices that belong to all, some and no minimum dominating sets of a tree, respectively, thus improving the quadratic time algorithm of Benecke and Mynhardt in 2008 [S.
Radosław Ziemann, Paweł Żyliński
doaj +1 more source
Inkanyiso, 2020 There has over the decades been a recrudescence of francophobia in many francophone African countries. This has attracted the attention of scholars across the world and has fuelled a discourse which has myopically constructed francophone Africans ...
Floribert P.C. Endong
doaj +1 more source
Distance domination versus iterated domination
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gábor Bacsó, Zsolt Tuza
openaire +1 more source
The Number of Minimum Dominating Sets in Pn × P2 [PDF]
, 2010 A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each vertex of G is dominated by at least k vertices of S.
Kishori P. Narayankar +5 more
core +1 more source