Results 91 to 100 of about 1,217,256 (282)

Autophagy and mitophagy in pancreatic β‐cell homeostasis and their involvement in diabetes pathophysiology

open access: yesFEBS 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

Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network

open access: yesFEBS 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

Alternative Domination in Graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
Sometimes while you are using the Internet, for example, via a Wi-Fi network from one of the companies, the Internet is suddenly cut off due to a malfunction at that point, which disrupts your important work on the Internet, so there is a need for ...
Ali Mohammed Sahal
doaj   +1 more source

Artificial molecular machines and motors—Design and control of nanoscale motion

open access: yesFEBS 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

Connected domination number and traceable graphs [PDF]

open access: yesElectronic Journal of Mathematics, 2023
Phillip Mafuta
doaj   +1 more source

Valency based domination number for Mycielskian of some graphs‎ [PDF]

open access: yesMathematics and Computational Sciences
Let 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

Weakly Connected Domination in Graphs

open access: yesElectronic Notes in Discrete Mathematics, 2009
Abstract In the last 50 years, Graph theory has seen an explosive growth due to interaction with areas like computer science, electrical and communication engineering, Operations Research etc. Perhaps the fastest growing area within graph theory is the study of domination, the reason being its many and varied applications in such fields as social ...
openaire   +2 more sources

On Domination in 2-Connected Cubic Graphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2008
In 1996, Reed proved that the domination number, $\gamma(G)$, of every $n$-vertex graph $G$ with minimum degree at least $3$ is at most $3n/8$ and conjectured that $\gamma(H)\leq\lceil n/3\rceil$ for every connected $3$-regular (cubic) $n$-vertex graph $H$.
openaire   +3 more sources

Leucine‐rich glioma inactivated 1 (LGI1) is a ganglioside‐binding protein

open access: yesFEBS Letters, EarlyView.
Neuronal hyperexcitability associated with a decrease/absence of the extracellular protein LGI1 has been suggested to be primarily due to the downregulation of Kv1 channel expression. The molecular mechanisms underlying this decrease have not yet been elucidated.
Kévin Debreux   +7 more
wiley   +1 more source

Approximation hardness of dominating set problems in bounded degree graphs [PDF]

open access: yes, 2008
We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka   +4 more
core   +1 more source

Home - About - Disclaimer - Privacy