Results 61 to 70 of about 11,214,082 (296)
On the total domatic number of regular graphs [PDF]
Transactions on Combinatorics, 2012 A set S of vertices of a graph G = (V;E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S.
H. Aram +2 more
doaj
An upper bound on the total outer-independent domination number of a tree [PDF]
Opuscula Mathematica, 2012 A total outer-independent dominating set of a graph \(G=(V(G),E(G))\) is a set \(D\) of vertices of \(G\) such that every vertex of \(G\) has a neighbor in \(D\), and the set \(V(G) \setminus D\) is independent.
Marcin Krzywkowski
doaj +1 more source
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
On total dominating sets in graphs
, 2008 A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices in a graph $G(V,E)$ is called a total dominating set if every vertex $v\in V$ is adjacent to an element of $S$. The domination number of a graph $G$ denoted by $γ(G)$ is the
Atapour, Maryam, Soltankhah, Nasrin
openaire +2 more sources
A Self-stabilizing Algorithm for Finding a Minimal K-Dominating Set in General Networks
, 2012 Since the publication of Dijkstra's pioneering paper, a lot of self-stabilizing algorithms for computing dominating sets have been proposed in the literature.
Hua Wang +7 more
core +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
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 2-Rainbow Domination Numbers of Trees
Discussiones Mathematicae Graph Theory, 2021 A 2-rainbow dominating function (2RDF) of a graph G = (V (G), E(G)) is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2} such that for every vertex v ∈ V (G) with f(v) = ∅ the condition ∪u∈N(v)f(u) = {1, 2} is fulfilled ...
Ahangar H. Abdollahzadeh +4 more
doaj +1 more source
NP-completeness Results for Partitioning a Graph into Total Dominating Sets [PDF]
Theoretical Computer Science, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mikko Koivisto +2 more
openaire +3 more sources
On resolving total dominating set of sunlet graphs
Journal of Physics: Conference Series, 2021 Abstract The set D ⊆ V(G) is called dominating set on graph G so that every vertex not in D is adjacent to at least one vertex in D. The set Dt ⊆ V(G) is called total dominating set on graph G so that the vertex in Dt are neighboring at least one dot in Dt . The smallest cardinality
R S R Ervani +4 more
openaire +1 more source