Results 81 to 90 of about 252,155 (281)
SIRT4 positively regulates autophagy via ULK1, but independently of HDAC6 and OPA1
Cells expressing SIRT4 (H161Y), a catalytically inactive mutant of the sirtuin SIRT4, fail to upregulate LC3B‐II and exhibit a reduced autophagic flux under stress conditions. Interestingly, SIRT4(H161Y) promotes phosphorylation of ULK1 at S638 and S758 that are associated with inhibition of autophagy initiation.
Isabell Lehmkuhl +13 more
wiley +1 more source
Alternative Domination in Graphs
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
Maximum Number of Minimum Dominating and Minimum Total Dominating Sets
Given a connected graph with domination (or total domination) number \gamma>=2, we ask for the maximum number m_\gamma and m_{\gamma,T} of dominating and total dominating sets of size \gamma.
Godbole, Anant +2 more
core
Upper bounds on the k-forcing number of a graph [PDF]
Given a simple undirected graph $G$ and a positive integer $k$, the $k$-forcing number of $G$, denoted $F_k(G)$, is the minimum number of vertices that need to be initially colored so that all vertices eventually become colored during the discrete ...
Amos, David +3 more
core
KLK7, a tissue kallikrein‐related peptidase, is elevated in advanced colorectal cancer and associated with shorter survival. High KLK7 levels in ascites correlate with peritoneal metastasis. In mice, KLK7 overexpression increases metastasis. In vitro, KLK7 enhances cancer cell proliferation, migration, adhesion, and spheroid formation, driving ...
Yosr Z. Haffani +6 more
wiley +1 more source
2-connected graphs with small 2-connected dominating sets
The main result of the paper is the following. Let \(G\) be a \(2\)-connected graph with \(n\) vertices and minimum degree \(\delta\). Then \(\gamma_2 \leq n(\ln(\delta)/\delta)(1+o_{\delta}(1))\), where \(\gamma_2\) is the minimum size of a \(2\)-connected dominating set of \(G\) and \(o_{\delta}(1)\) denotes a function that tends to 0 as \(\delta ...
Caro, Yair, Yuster, Raphael
openaire +1 more source
Enzymes of the 2‐hydroxyacyl‐CoA lyase group catalyze the condensation of formyl‐CoA with aldehydes or ketones. Thus, by structural adaptation of active sites, practically any pharmaceutically and industrially important 2‐hydroxyacid could be biotechnologically synthesized. Combining crystal structure analysis, active site mutations and kinetic assays,
Michael Zahn +4 more
wiley +1 more source
Connected domination number and traceable graphs [PDF]
Phillip Mafuta
doaj +1 more source
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
Connective Dominating In SuperHyperGraphs
“Book #177” [ADDRESSED CITATION] [HG177b] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8051368). @googlebooks:https://books.google.com/books/about?id=- @GooglePlay:https://play.google.com/store/books/details?id=- @ResearchGate: https://www.researchgate.net/publication/- @WordPress: https ...
openaire +1 more source

