Results 91 to 100 of about 9,176,317 (295)
Maker–Breaker Domination Number [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2019 The Maker-Breaker domination game is played on a graph $G$ by Dominator and Staller. The players alternatively select a vertex of $G$ that was not yet chosen in the course of the game. Dominator wins if at some point the vertices he has chosen form a dominating set. Staller wins if Dominator cannot form a dominating set.
Valentin Gledel +2 more
openaire +2 more sources
FEBS 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
Variants of the Domination Number for Flower Snarks [PDF]
, 2023 We consider the flower snarks, a widely studied infinite family of 3--regular graphs. For the Flower snark $J_n$ on $4n$ vertices, it is trivial to show that the domination number of $J_n$ is equal to $n$. However, results are more difficult to determine
Burdett, Ryan +2 more
core +1 more source
A note on domination and independence-domination numbers of graphs
Ars Mathematica Contemporanea, 2012 Vizing's conjecture is true for graphs G satisfying γ i ( G ) = γ ( G ), where γ ( G ) is the domination number of a graph G and γ i ( G ) is the independence-domination number of G , that is, the maximum, over all independent sets I in G , of the minimum number of vertices needed to dominate I . The equality γ i ( G ) = γ (
openaire +4 more sources
Investigating transcription factor dynamics in health and disease using FRAP
FEBS 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
On a Vizing-type Integer Domination Conjecture
Theory and Applications of Graphs, 2020 Given a simple graph G, a dominating set in G is a set of vertices S such that every vertex not in S has a neighbor in S. Denote the domination number, which is the size of any minimum dominating set of G, by γ(G). For any integer k ≥ 1, a function f : V
Elliot Krop, Randy Davila
doaj +1 more source
Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential
FEBS 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
On the domination number of a graph
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On graphs for which the connected domination number is at most the total domination number. Discrete [PDF]
, 2012 In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Oliver Schaudt
core
Structure‐forward targeting of claudins with synthetic binders
FEBS Letters, EarlyView.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