Results 41 to 50 of about 2,348 (174)
Cancer‐Associated BCL‐2 Mutants Reveal Mechanisms Towards Venetoclax Resistance
Venetoclax (VEN) resistance in chronic lymphocytic leukemia arises from diverse BCL2 mutations. We map mechanisms contributing to VEN resistance across common BCL‐2 variants. G101V and D103Y reduce drug binding and increase sequestration of pro‐apoptotic proteins. V156D blocks VEN allosterically.
Jonas Aufdermauer +9 more
wiley +1 more source
Jaw‐specific stem cell dynamics are associated with distinct enamel architecture in mouse incisors
Abstract Background The continuously growing mouse incisor serves as a model for stem cell‐driven tooth renewal. Although mice possess maxillary and mandibular incisors, most studies have focused on the mandible. Potential differences in structure and renewal between these serially homologous organs remain insufficiently characterized.
Elias Shahin +4 more
wiley +1 more source
Distance Magic Graphs - a Survey [PDF]
Let <i>G = (V;E)</i> be a graph of order n. A bijection <i>f : V → {1, 2,...,n} </i>is called <i>a distance magic labeling </i>of G if there exists a positive integer k such that <i>Σ f(u) = k &
Arumugam, S. (S) +2 more
core
Tetravalent distance magic graphs of small order and an infinite family of examples [PDF]
A graph of order $n$ is distance magic if it admits a bijective labeling of its vertices with integers from $1$ to $n$ such that each vertex has the same sum of the labels of its neighbors.
Šparl, Primož, Rozman, Ksenija
core +1 more source
Distance Magic Labeling in Complete 4-partite Graphs [PDF]
Let $G$ be a complete $k$-partite simple undirected graph with parts of sizes $p_1\le p_2...\le p_k$. Let $P_j=\sum_{i=1}^jp_i$ for $j=1,...,k$. It is conjectured that $G$ has distance magic labeling if and only if $\sum_{i=1}^{P_j} (n-i+1)\ge j{{n+1}\choose{2}}/k$ for all $j=1,...,k$.
openaire +3 more sources
Brokering Localization: Country‐Based Pooled Funds in Humanitarian Assistance
ABSTRACT This article analyzes Country‐Based Pooled Funds (CBPFs) to identify types of brokerage models and their effects on localization. CBPFs are intermediaries in the aid chain connecting donors to implementers such as the United Nations, international non‐governmental organizations (INGOs) and national NGOs (NNGOs). This paper analyzes four of the
Maryam Zarnegar Deloffre
wiley +1 more source
The distance magic property and two families of Cartesian product graphs
Let G = G(V, E) be a simple graph. The graph G is said to be distance magic if there exists a bijection f : V → {1, 2, …, |V|} and a constant s such that Σy ∈ N(x)f(y)=s for all x ∈ V.
Patrick Thomas Headley
doaj +1 more source
Group distance magic labeling of direct product of graphs
A distance magic labeling of a graph of order \(n\) is a bijection from the vertex set to \(\{0,1,\dots,n-1\}\) such that the sum of neighbors of any vertex is the same. Magic labellings of graphs have been studied as a generalization of magic squares. A central question has been to identify which graphs admit such labelings.
Marcin Anholcer +3 more
openaire +4 more sources
Biodiversity is threatened by human activities, with extinction debt accumulating rapidly. Many of these activities change the connectivity of populations, fragmenting existing population systems or bringing previously isolated populations or species into contact.
Zhiqin Long +7 more
wiley +1 more source
Proposing a Framework to Center Justice in Ambitious Science Teaching
ABSTRACT Though educators and researchers have developed shared theory and language for priorities necessary to disrupt the status quo toward more equitable science education, we lack a tool that organizes sets of teaching practices across an instructional unit to support enactment and rehearsal.
April Luehmann +8 more
wiley +1 more source

