Results 71 to 80 of about 43,787 (293)
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
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS Letters, EarlyView.Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source
Total Domination Versus Paired-Domination in Regular Graphs
Discussiones Mathematicae Graph Theory, 2018 A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph
Cyman Joanna +4 more
doaj +1 more source
An [Imperfect] Case for Dyadic Research in Pediatric Psychosocial Oncology
Pediatric Blood &Cancer, EarlyView.
Stephanie M. Nanos +2 more
wiley +1 more source
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS Letters, EarlyView.Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
Two Short Proofs on Total Domination
Discussiones Mathematicae Graph Theory, 2013 A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set.
Bickle Allan
doaj +1 more source
Graphs with large disjunctive total domination number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Michael A. Henning, Viroshan Naicker
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
Upper Bounds on the Signed Total (K, K)-Domatic Number of Graphs
Discussiones Mathematicae Graph Theory, 2015 Let G be a graph with vertex set V (G), and let f : V (G) → {−1, 1} be a two-valued function. If k ≥ 1 is an integer and Σx∈N(v) f(x) ≥ k for each v ∈ V (G), where N(v) is the neighborhood of v, then f is a signed total k-dominating function on G. A set {
Volkmann Lutz
doaj +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