Results 81 to 90 of about 232,724 (277)

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

open access: yesMolecular Oncology, EarlyView.
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson   +9 more
wiley   +1 more source

Maximum Number of Minimum Dominating and Minimum Total Dominating Sets

open access: yes, 2013
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  

Total outer-connected domination number of middle graphs

open access: yes, 2023
In this paper, we study the total outer-connected domination number of the middle graph of a simple graph and we obtain tight bounds for this number in terms of the order of the middle graph. We also compute the total outer-connected domination number of some families of graphs, explicitly.
Kazemnejad, Farshad   +3 more
openaire   +2 more sources

RIPK4 function interferes with melanoma cell adhesion and metastasis

open access: yesMolecular Oncology, EarlyView.
RIPK4 promotes melanoma growth and spread. RIPK4 levels increase as skin lesions progress to melanoma. CRISPR/Cas9‐mediated deletion of RIPK4 causes melanoma cells to form less compact spheroids, reduces their migratory and invasive abilities and limits tumour growth and dissemination in mouse models.
Norbert Wronski   +9 more
wiley   +1 more source

Domination criticality in product graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2015
A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G
M.R. Chithra, A. Vijayakumar
doaj   +1 more source

Rethinking plastic waste: innovations in enzymatic breakdown of oil‐based polyesters and bioplastics

open access: yesFEBS Open Bio, EarlyView.
Plastic pollution remains a critical environmental challenge, and current mechanical and chemical recycling methods are insufficient to achieve a fully circular economy. This review highlights recent breakthroughs in the enzymatic depolymerization of both oil‐derived polyesters and bioplastics, including high‐throughput protein engineering, de novo ...
Elena Rosini   +2 more
wiley   +1 more source

Extremal connected graphs for independent domination number

open access: yesDiscrete Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brigham, Robert C.   +2 more
openaire   +3 more sources

SIRT4 positively regulates autophagy via ULK1, but independently of HDAC6 and OPA1

open access: yesFEBS Open Bio, EarlyView.
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

On graphs with equal total domination and connected domination numbers

open access: yesApplied Mathematics Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Triple Connected Domination Number Of A Graph

open access: yes, 2012
The concept of triple connected graphs with real life application was introduced in [7] by considering the existence of a path containing any three vertices of a graph G. In this paper, we introduce a new domination parameter, called Smarandachely triple connected domination number of a graph.
Mahadevan, G.   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy