Results 61 to 70 of about 13,115 (262)

Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system

open access: yesFEBS Letters, EarlyView.
Age‐dependent shifts in microbial communities engender shifts in microbial metabolite profiles. These in turn drive shifts in barrier surface permeability of the gut and brain and induce immune activation. When paired with preexisting age‐related chronic inflammation this increases the risk of neuroinflammation and neurodegenerative diseases.
Aaron Mehl, Eran Blacher
wiley   +1 more source

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

Total dominating sequences in graphs

open access: yesDiscrete Mathematics, 2016
A vertex in a graph totally dominates another vertex if they are adjacent. A sequence of vertices in a graph $G$ is called a total dominating sequence if every vertex $v$ in the sequence totally dominates at least one vertex that was not totally dominated by any vertex that precedes $v$ in the sequence, and at the end all vertices of $G$ are totally ...
Bostjan Bresar   +2 more
openaire   +2 more sources

Total domination and vertex-edge domination in trees [PDF]

open access: yesProyecciones (Antofagasta), 2019
A vertex v of a graph G = (V,E) is said to ve-dominate every edge incident to v, as well as every edge adjacent to these incident edges. A set S ⊆ V is a vertex-edge dominating set if every edge of E is ve-dominated by at least one vertex of S. The minimum cardinality of a vertex-edge dominating set of G is the vertex-edge domination number γve(G) . In
Venkatakrishnan Y. B.   +2 more
openaire   +3 more sources

Diversity and complexity in neural organoids

open access: yesFEBS Letters, EarlyView.
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
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

On the Game Total Domination Number [PDF]

open access: yesGraphs and Combinatorics, 2018
11 ...
openaire   +2 more sources

The ubiquitin ligase RNF115 is required for the clearance of damaged lysosomes

open access: yesFEBS Letters, EarlyView.
Upon lysosomal rupture, an E3 ubiquitin ligase RNF115 translocates from the cytosol to the damaged lysosomal membrane. Moreover, RNF115 depletion impairs the clearance of damaged lysosomes, identifying it as a key regulator of lysosomal quality control.
Sae Nakanaga   +3 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