Results 101 to 110 of about 11,106,432 (291)

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, Cornelia Wiegand, Omid Omrani, Mario Fabri   +3 more
wiley   +1 more source

Computational Complexity of Outer-Independent Total and Total Roman Domination Numbers in Trees

IEEE Access, 2018
An outer-independent total dominating set (OITDS) of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V (G) \ D is independent.
Zepeng Li, Zehui Shao, Fangnian Lang, Xiaosong Zhang, Jia-Bao Liu   +4 more
doaj   +1 more source

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

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, Mingming Tong, Anna L. Gloyn   +2 more
wiley   +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

Fuzzy Graphs With Equal Fuzzy Domination And Independent Domination Numbers [PDF]

, 2013
The basic definitions of fuzzy independent set, fuzzy dominating set,and fuzzy independent dominating sets are discussed. The aim of this paper is to find on what conditions the fuzzy graph has equal domination number and independent domination number ...
Nagoorgani, A.; P.G. & Research Department of Mathematics, Vijayalakshmi, P.; Department of Mathematics   +1 more
core  

Independent domination stability in graphs

, 2023
A non-empty set $S\subseteq V (G)$ of the simple graph $G=(V(G),E(G))$ is an independent dominating set of $G$ if every vertex not in $S$ is adjacent with some vertex in $S$ and the vertices of $S$ are pairwise non-adjacent.
Mehraban, Mazharodin, Zakharov, Alexei, Alikhani, Saeid, Golmohammadi, Hamidreza   +3 more
core  

Strong Domination Index in Fuzzy Graphs

Fuzzy Information and Engineering
In this article, a novel idea of domination degree and index are defined in a fuzzy graph (FG) using weight of strong edges. The strong domination degree (SDD) of a vertex u is defined using the weight of minimal strong dominating set (MSDS) containing u.
Kavya R. Nair, Muraleedharan Shetty Sunitha   +1 more
doaj   +1 more source

Partial depletion of plasminogen activator inhibitor‐1 decreases subcutaneous fat cell hypertrophy and liver cholesterol in high‐fat‐fed female mice

FEBS Letters, EarlyView.
Obesity raises blood levels of PAI‐1, a protein linked to metabolic dysfunction‐associated steatotic liver disease in people with obesity. In female mice fed a high‐fat diet, partially lowering PAI‐1 led to smaller subcutaneous fat cells and lower liver cholesterol, without changing body weight or insulin sensitivity.
Claudia E. Ramirez Bustamante, Robert Sharp, Pradip K. Saha, Elizabeth S. Anaya, Elizabeth L. Lieu, Evelyn L. de Groot, Pooja Patel, Mi Jeong Heo, Aaron R. Cox, Kang Ho Kim, Sean M. Hartig   +10 more
wiley   +1 more source

Triangle-free graphs with large independent domination number [PDF]

, 2010
Let G be a simple graph of order n and minimum degree δ. The independent domination number i(G) is defined as the minimum cardinality of an independent dominating set of G. We prove the following conjecture due to Haviland [J.
Chen, Xue-gang, Chan, Wai Hong, Shiu, Wai Chee   +2 more
core   +1 more source

On equality in an upper bound for the acyclic domination number [PDF]

Opuscula Mathematica, 2008
A subset \(A\) of vertices in a graph \(G\) is acyclic if the subgraph it induces contains no cycles. The acyclic domination number \(\gamma_a(G)\) of a graph \(G\) is the minimum cardinality of an acyclic dominating set of \(G\).
Vladimir Samodivkin
doaj