Results 81 to 90 of about 6,662,662 (243)
Product throttling for power domination [PDF]
, 2020 The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number.
Trenk, Ann +6 more
core
Total domination and vertex-edge domination in trees [PDF]
Proyecciones (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
Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system
FEBS 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
Diversity and complexity in neural organoids
FEBS 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
Further Results on Total Edge-Vertex Domination
, 2022 Total edge-vertex domination is a new total domination-type parameter. In this paper, the author shows that determining the total edge-vertex domination number in bipartite planar graphs is NP-complete.
Abdulgani Şahin
core +1 more source
On the Total Version of Triple Roman Domination in Graphs
MathematicsIn 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
Mathematics, 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
The human gut microbiome across the life course
FEBS Letters, EarlyView.Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero +4 more
wiley +1 more source
Total domination excellent trees [PDF]
, 2003 A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S (other than itself). The graph G is called total domination excellent if every vertex belongs to some total dominating set of G of ...
Henning, Michael A.
core +1 more source
On Total Domination in the Cartesian Product of Graphs
Discussiones 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