Results 71 to 80 of about 11,901,808 (241)

Total Domination Versus Paired-Domination in Regular Graphs

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

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik   +5 more
wiley   +1 more source

Two Short Proofs on Total Domination

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

Total 2-Rainbow Domination Numbers of Trees

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

ABL kinase‐dependent phosphorylation of SH proteins promotes their direct interaction with CRK family SH2 domains

open access: yesFEBS Letters, EarlyView.
CT10 regulator of kinase (CRK) and CRK‐Like (CRKL) are signaling adaptors driving cell adhesion, motility, differentiation, and proliferation. SH2‐domain containing (SH) proteins are enriched in YXXP motifs which when phosphorylated create preferred binding sites for CRK family SH2 domains.
Phoebe M. Cousens   +8 more
wiley   +1 more source

Investigating transcription factor dynamics in health and disease using FRAP

open access: yesFEBS Letters, EarlyView.
FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj   +3 more
wiley   +1 more source

Upper Bounds on the Signed Total (K, K)-Domatic Number of Graphs

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

Finding a weighted positive influence dominating set in e-learning social networks [PDF]

open access: yes, 2013
Online social network has developed significantly in recent years. Most of current research has utilized the property of online social network to spread information and ideas.
Zhu, Guohun   +4 more
core  

Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential

open access: yesFEBS Letters, EarlyView.
Aging reshapes the gut microbiome (↓SCFA‐producing commensals; ↑pro‐inflammatory outputs), shifting circulating metabolites (↓SCFAs; ↑LPS, ↑TMAO, ↑PAA) that act at the BBB to increase nonspecific transcytosis, alter transport, and promote astrocyte reactivity, heightening brain vulnerability.
Daniel Cuervo‐Zanatta   +3 more
wiley   +1 more source

Domination Parameters of a Graph and its Complement

open access: yesDiscussiones Mathematicae Graph Theory, 2018
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G.
Desormeaux Wyatt J.   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy