Results 111 to 120 of about 8,731,938 (294)
Epigenetic reprogramming of lineage switching in cancer
FEBS Letters, EarlyView.Cancer cells rarely commit to a single identity. Epigenetic mechanisms and tumor microenvironment cues push epithelial cells toward flexible, hybrid states that can shift into mesenchymal, neuroendocrine, or stem‐like fates, driving metastasis, drug resistance, and tumor heterogeneity. Targeting the epigenetic regulators behind these transitions, using
Ezgi Boyvatlı +4 more
wiley +1 more source
The Italian bondage and reinforcement numbers of digraphs
Electronic Journal of Graph Theory and ApplicationsAn Italian dominating function on a digraph D with vertex set V(D) is defined as a function f : V(D) → {0, 1, 2} such that every vertex v ∈ V(D) with f(v) = 0 has at least two in-neighbors assigned 1 under f or one in-neighbor w with f(w) = 2. The weight
Kijung Kim
doaj +1 more source
The microbiome in human skin aging
FEBS Letters, EarlyView.Age‐related skin changes encompass the well‐known visible phenotypic alterations, together with microbiome dysbiosis and a series of molecular aging hallmarks. These hallmarks characterize not only a fully stablished aged phenotype but also the skin aging process itself.
Manuel Huerta Arana +3 more
wiley +1 more source
On domination number of 4-regular graphs [PDF]
, 2004 summary:Let $G$ be a simple graph. A subset $S \subseteq V$ is a dominating set of $G$, if for any vertex $v \in V~- S$ there exists a vertex $u \in S$ such that $uv \in E (G)$.
Liu, Hailong, Sun, Liang
core +1 more source
A dynamic domination problem in trees [PDF]
Transactions on Combinatorics, 2015 We consider a dynamic domination problem for graphs in which an infinite sequence of attacks occur at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard. Other guards
William Klostermeyer, Christina Mynhardt
doaj
FEBS Letters, EarlyView.This review focuses on the role of autophagy and mitophagy in maintaining pancreatic β‐cell function and homeostasis. We discuss how genetic defects affecting these pathways contribute to the development of type 1, type 2, monogenic, and gestational diabetes. We further explore their potential as therapeutic targets. Created in BioRender.
Yunkyeong Lee +2 more
wiley +1 more source
The domination parameters of cubic graphs [PDF]
, 2005 Let ir(G), γ(G), i(G), β0(G), Γ(G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively.
Zverovich, Vadim, Zverovich, Igor E.
core +1 more source
Valency based domination number for Mycielskian of some graphs [PDF]
Mathematics and Computational SciencesLet G = (V, E) be a connected graph and γvb(G) denotes the valency based domination number of G or simply vb-domination number of G. In this paper, analogous to isolated vertex in domination, defined valency based isolated vertex (or simply, vb-isolated ...
Kavitha Thilakan +1 more
doaj +1 more source
Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network
FEBS Letters, EarlyView.Golgi enzymes are traditionally considered resident proteins retained within the Golgi apparatus. Here, we demonstrate that a subset transiently reaches the cell surface and is subsequently retrieved to the trans‐Golgi network via retrograde transport. Using a nanobody‐based toolkit, we uncover a dynamic trafficking cycle of several Golgi enzymes.
Dominik P. Buser, Tina Junne
wiley +1 more source
On domination number and distance in graphs
Discrete Applied Mathematics, 2016 A vertex set $S$ of a graph $G$ is a \emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \emph{domination number} $γ(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over all dominating sets of $G$. It is known that $γ(G) \ge \frac{1}{3}(diam(G)+1)$, where $diam(G)$ denotes the diameter of $
openaire +2 more sources