Results 61 to 70 of about 1,521,521 (318)
The role of fibroblast growth factors in cell and cancer metabolism
Fibroblast growth factor (FGF) signaling regulates crucial signaling cascades that promote cell proliferation, survival, and metabolism. Therefore, FGFs and their receptors are often dysregulated in human diseases, including cancer, to sustain proliferation and rewire metabolism.
Jessica Price, Chiara Francavilla
wiley +1 more source
Trees with large neighborhood total domination number
13 ...
Henning, Michael A., Wash, Kirsti
openaire +3 more sources
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
Nordhaus–Gaddum type inequalities on the total Italian domination number in graphs [PDF]
Seyed Mahmoud Sheikholeslami +1 more
openalex +1 more source
On the $k$-limited packing numbers in graphs
We give a sharp lower bound on the lower $k$-limited packing number of a general graph. Moreover, we establish a Nordhaus-Gaddum type bound on $2$-limited packing number of a graph. Also, we investigate the concepts of packing number ($1$-limited packing
Samadi, Babak
core +1 more source
An intracellular transporter mitigates the CO2‐induced decline in iron content in Arabidopsis shoots
This study identifies a gene encoding a transmembrane protein, MIC, which contributes to the reduction of shoot Fe content observed in plants under elevated CO2. MIC is a putative Fe transporter localized to the Golgi and endosomal compartments. Its post‐translational regulation in roots may represent a potential target for improving plant nutrition ...
Timothy Mozzanino +7 more
wiley +1 more source
k-Tuple_Total_Domination_in_Inflated_Graphs
The inflated graph $G_{I}$ of a graph $G$ with $n(G)$ vertices is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(
Kazemi, Adel P.
core +1 more source
Anaplastic thyroid cancer (ATC) lacks iodide uptake ability due to MAPK activation increasing the expression of the histone methyltransferase EZH2, which represses thyroid differentiation genes (TDGs) such as the sodium iodide symporter (NIS). Dual inhibition of MAPK (U0126) and EZH2 (EPZ6438/Tazemetostat) reverses this mechanism, thus restoring TDG ...
Diego Claro de Mello +6 more
wiley +1 more source
Bounding the Porous Exponential Domination Number of Apollonian Networks [PDF]
Given a graph G with vertex set V, a subset S of V is a dominating set if every vertex in V is either in S or adjacent to some vertex in S. The size of a smallest dominating set is called the domination number of G.
Beverly, Joshua +3 more
core
Total Dominating Sequences in Graphs
A vertex in a graph totally dominates another vertex if they are adjacent. A sequence of vertices in a graph $G$ is called a total dominating sequence if every vertex $v$ in the sequence totally dominates at least one vertex that was not totally ...
Bresar, Bostjan +2 more
core +1 more source

