Results 71 to 80 of about 366,581 (319)

On the total Roman domination stability in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
A total Roman dominating function on a graph G is a function satisfying the conditions: (i) every vertex u with f(u) = 0 is adjacent to at least one vertex v of G for which f(v) = 2; (ii) the subgraph induced by the vertices assigned non-zero values has ...
Ghazale Asemian   +3 more
doaj   +1 more source

By dawn or dusk—how circadian timing rewrites bacterial infection outcomes

open access: yesFEBS 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 a Class of Graphs with Large Total Domination Number

open access: yes, 2018
Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$.
Bahadır, Selim, Gözüpek, Didem
core   +1 more source

Structural insights into lacto‐N‐biose I recognition by a family 32 carbohydrate‐binding module from Bifidobacterium bifidum

open access: yesFEBS 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

Bounding the Porous Exponential Domination Number of Apollonian Networks [PDF]

open access: yes, 2014
Given a graph G with vertex set V, a subset S of V is a dominating set if every vertex in V is either in S or adjacent to some vertex in S. The size of a smallest dominating set is called the domination number of G.
Beverly, Joshua   +3 more
core  

Molecular bases of circadian magnesium rhythms across eukaryotes

open access: yesFEBS Letters, EarlyView.
Circadian rhythms in intracellular [Mg2+] exist across eukaryotic kingdoms. Central roles for Mg2+ in metabolism suggest that Mg2+ rhythms could regulate daily cellular energy and metabolism. In this Perspective paper, we propose that ancestral prokaryotic transport proteins could be responsible for mediating Mg2+ rhythms and posit a feedback model ...
Helen K. Feord, Gerben van Ooijen
wiley   +1 more source

On the Total Version of Triple Roman Domination in Graphs

open access: yesMathematics
In this paper, we describe the study of total triple Roman domination. Total triple Roman domination is an assignment of labels from {0,1,2,3,4} to the vertices of a graph such that every vertex is protected by at least three units either on itself or ...
Juan Carlos Valenzuela-Tripodoro   +3 more
doaj   +1 more source

On the Total Outer k-Independent Domination Number of Graphs

open access: yesMathematics, 2020
A set of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex in such a set. We say that a total dominating set D is a total outer k-independent dominating set of G if the maximum degree of the subgraph ...
Abel Cabrera-Martínez   +3 more
doaj   +1 more source

Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10

open access: yesFEBS Letters, EarlyView.
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang   +8 more
wiley   +1 more source

On Total Domination in the Cartesian Product of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2018
Ho proved in [A note on the total domination number, Util. Math. 77 (2008) 97–100] that the total domination number of the Cartesian product of any two graphs without isolated vertices is at least one half of the product of their total domination numbers.
Brešar Boštjan   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy