Results 81 to 90 of about 14,893,384 (293)
Domination parameters of a graph with added vertex [PDF]
Let \(G=(V,E)\) be a graph. A subset \(D\subseteq V\) is a total dominating set of \(G\) if for every vertex \(y\in V\) there is a vertex \(x\in D\) with \(xy\in E\).
Maciej Zwierzchowski
doaj
Design and analysis strategies for robust microbiome ageing research
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
The Moore graphs; total domination and total dominator chromatic numbers
A total dominator coloring of a graph G is a proper coloring of G in which each vertex of the graph is adjacent to all vertices of a color class. The minimum number of color classes in a total dominator coloring of a graph is called its total dominator chromatic number.
Maliheh Alaei, Adel Kazemi
openaire +1 more source
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
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
On signed arc total domination in digraphs [PDF]
Let \(D=(V,A)\) be a finite simple digraph and \(N(uv)=\{u^{\prime}v^{\prime}\neq uv \mid u=u^{\prime}\text{ or }v=v^{\prime}\}\) be the open neighbourhood of \(uv\) in \(D\).
Leila Asgharsharghi +2 more
doaj +1 more source
Total domination number of grid graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential
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
On the total domination number of cross products of graphs
We give lower and upper bounds on the total domination number of the cross product of two graphs, γ t(G×H). These bounds are in terms of the total domination number and the maximum degree of the factors and are best possible. We further investigate cross products involving paths and cycles. We determine the exact values of γ t(G×Pn) and γ
Gravier, Sylvain +2 more
openaire +5 more sources
Structure‐forward targeting of claudins with synthetic binders
Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley +1 more source

