Results 71 to 80 of about 252,155 (281)
New bound on MIS and MIN-CDS for a unit ball graph
ICT Express, 2017 The size of the maximum independent set (MIS) in a graph G is called the independence number. The size of the minimum connected dominating set (MIN-CDS) in G is called the connected domination number.
D.A. Mojdeh, M. Ghanbari, M. Ramezani
doaj +1 more source
Graphs with Large Disjunctive Total Domination Number
, 2014 Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $\gamma_t(G)$.
Henning, Michael A., Naicker, Viroshan
core +2 more sources
Basroparib inhibits YAP‐driven cancers by stabilizing angiomotin
Molecular Oncology, EarlyView.Basroparib, a selective tankyrase inhibitor, suppresses Wnt signaling and attenuates YAP‐driven oncogenic programs by stabilizing angiomotin. It promotes AMOT–YAP complex formation, enforces cytoplasmic YAP sequestration, inhibits YAP/TEAD transcription, and sensitizes YAP‐active cancers, including KRAS‐mutant colorectal cancer, to MEK inhibition.
Young‐Ju Kwon +4 more
wiley +1 more source
Molecular Oncology, EarlyView.Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova +25 more
wiley +1 more source
A Graph Class related to the Structural Domination Problem [PDF]
, 2010 In the structural domination problem one is concerned with the question if a given graph has a connected dominating set whose induced subgraph has certain structural properties.
Schaudt, Oliver
core
Proper connection number and connected dominating sets
Theoretical Computer Science, 2015 The proper connection number $pc(G)$ of a connected graph $G$ is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of $G$ is connected by at least one path in $G$ such that no two adjacent edges of the path are colored the same, and such a path is called a proper path. In this paper, we show that
Li, Xueliang, Wei, Meiqin, Yue, Jun
openaire +3 more sources
Molecular 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
RIPK4 function interferes with melanoma cell adhesion and metastasis
Molecular 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
Rethinking plastic waste: innovations in enzymatic breakdown of oil‐based polyesters and bioplastics
FEBS 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
Linear Kernel for Planar Connected Dominating Set [PDF]
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lokshtanov, D., Mnich, M., Saurabh, S.
openaire +2 more sources