Results 81 to 90 of about 10,021,129 (363)
On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree
Mathematics, 2020 A dominating set in a graph G is a set of vertices S ⊆ V ( G ) such that any vertex of V − S is adjacent to at least one vertex of S .
Zehui Shao +4 more
doaj +1 more source
A note on the bounds of Roman domination numbers
AIMS Mathematics, 2021 Let $G$ be a graph and $f: V(G) \rightarrow \{0,1,2\}$ be a mapping. $f$ is said to be a Roman dominating function of $G$ if every vertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex $v$ for which $f(v)=2$.
Zepeng Li
doaj +1 more source
The bondage number of random graphs [PDF]
, 2016 A dominating set of a graph is a subset $D$ of its vertices such that every vertex not in $D$ is adjacent to at least one member of $D$. The domination number of a graph $G$ is the number of vertices in a smallest dominating set of $G$.
Mitsche, Dieter +2 more
core +2 more sources
Graphs with large semipared domination number
Discussiones Mathematicae Graph Theory, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haynes, Teresa W., Henning, Michael A.
openaire +3 more sources
Trees with vertex-edge Roman Domination number twice the domination number minus one
Proyecciones (Antofagasta), 2020 A vertex-edge Roman dominating function (or just ve-RDF) of a graph G = (V, E) is a function f : V (G) → {0, 1, 2} such that for each edge e = uv either max{f (u), f (v)} ≠ 0 or there exists a vertex w such that either wu ∈ E or wv ∈ E and f (w) = 2. The weight of a ve-RDF is the sum of its function values over all vertices.
H. Naresh Kumar, Y. B. Venkatakrishnan
openaire +3 more sources
By dawn or dusk—how circadian timing rewrites bacterial infection outcomes
FEBS Letters, EarlyView.The circadian clock shapes immune function, yet its influence on infection outcomes is only beginning to be understood. This review highlights how circadian timing alters host responses to the bacterial pathogens Salmonella enterica, Listeria monocytogenes, and Streptococcus pneumoniae revealing that the effectiveness of immune defense depends not only
Devons Mo +2 more
wiley +1 more source
On (t,r) Broadcast Domination Numbers of Grids [PDF]
, 2014 The domination number of a graph $G = (V,E)$ is the minimum cardinality of any subset $S \subset V$ such that every vertex in $V$ is in $S$ or adjacent to an element of $S$.
Blessing, David +3 more
core
The domination number of K_{n}^3
Discussiones Mathematicae Graph Theory, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Georges John, Lin Jianwei, Mauro David
openaire +3 more sources
FEBS Letters, EarlyView.Bifidobacterium bifidum establishes symbiosis with infants by metabolizing lacto‐N‐biose I (LNB) from human milk oligosaccharides (HMOs). The extracellular multidomain enzyme LnbB drives this process, releasing LNB via its catalytic glycoside hydrolase family 20 (GH20) lacto‐N‐biosidase domain.
Xinzhe Zhang +5 more
wiley +1 more source
The domination number and the least $Q$-eigenvalue [PDF]
, 2013 A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all dominating sets of $
Guo, Shu-Guang +3 more
core