Results 81 to 90 of about 9,933,640 (289)
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
Weakly connected domination critical graphs [PDF]
Opuscula Mathematica, 2008 A dominating set \(D \subset V(G)\) is a weakly connected dominating set in \(G\) if the subgraph \(G[D]_w = (N_{G}[D],E_w)\) weakly induced by \(D\) is connected, where \(E_w\) is the set of all edges with at least one vertex in \(D\).
Magdalena Lemańska, Agnieszka Patyk
doaj
Graphs and CombinatoricsAbstractLet G be a bridgeless graph. An orientation of G is a digraph obtained from G by assigning a direction to each edge. The oriented diameter of G is the minimum diameter among all strong orientations of G. The connected domination number $$\gamma _c(G)$$ γ c
Peter Dankelmann +2 more
openaire +3 more sources
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
Making a Dominating Set of a Graph Connected
Discussiones Mathematicae Graph Theory, 2018 Let G = (V,E) be a graph and S ⊆ V. We say that S is a dominating set of G, if each vertex in V \ S has a neighbor in S. Moreover, we say that S is a connected (respectively, 2-edge connected or 2-connected) dominating set of G if G[S] is connected ...
Li Hengzhe, Wu Baoyindureng, Yang Weihua
doaj +1 more source
Computing locating-total domination number in some rotationally symmetric graphs
Science Progress, 2021 Let G = ( V , E ) be a connected graph. A locating-total dominating set in a graph G is a total dominating set S of a G , for every pair of vertices i , j ∈ V ( G ) ∖ S , such that N ( i ) ∩ S ≠ N ( j ) ∩ S .
Hassan Raza +3 more
doaj +1 more source
Structural and biochemical analysis of a B12 superbinder
FEBS Letters, EarlyView.BtuG proteins are vitamin B12 scavengers in Bacteroides thetaiotaomicron, a dominant human gut bacterium. We present crystal structures of three BtuG homologs bound to cobalamin and its precursor cobinamide, revealing picomolar binding affinities, among the highest known for any natural protein.
Jose M. Martinez Felices +3 more
wiley +1 more source
Artificial molecular machines and motors—Design and control of nanoscale motion
FEBS Letters, EarlyView.Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley +1 more source
FEBS Letters, EarlyView.Heterodimeric amino acid transporters consist of SLC7 and SLC3 family proteins arranged in a conserved structural organization. They regulate nutrient transport across cell membranes, supporting essential cellular functions. These transporters also contribute to xenobiotic/drug uptake and distribution.
Mariafrancesca Scalise +5 more
wiley +1 more source
مجلة بغداد للعلوم, 2019 The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination.
Omran et al.
doaj +1 more source