Results 111 to 120 of about 490,847 (283)
Approximating a Minimum Dominating Set by Purification
AlgorithmsA dominating set of a graph is a subset of vertices such that every vertex not in the subset has at least one neighbor within the subset. The corresponding optimization problem is known to be NP-hard.
Ernesto Parra Inza +3 more
doaj +1 more source
Arab Journal of Mathematical Sciences, 2016 A set D of vertices of a graph G is called a dominating set of G if every vertex in V(G)−D is adjacent to a vertex in D. A dominating set S such that the subgraph 〈S〉 induced by S has at least one isolated vertex is called an isolate dominating set.
I. Sahul Hamid, S. Balamurugan
doaj +1 more source
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
Molecular Oncology, EarlyView.This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source
Molecular Oncology, EarlyView.Dimethyl fumarate (DMF) reduces growth of HPV‐positive cervical cancer spheroids and induces ferroptosis in cervical cancer cells via blocking SLC7A11/Glutathione (GSH) axis. Combination of subcytotoxic doses of DMF and cisplatin (CDDP) further suppresses spheroid growth and drives cell death in 2D culture models.
Carolina Punziano +6 more
wiley +1 more source
Dominating Sets and Local Treewidth
, 2003 It is known that the treewidth of a planar graph with a dominating set of size d is O(sqrt{d}) and this fact is used as the basis for several fixed parameter algorithms on planar graphs. An interesting question motivating our study is if similar bounds can be obtained for larger minor closed graph families. We say that a graph
Thilikos Touloupas, Dimitrios +1 more
openaire +2 more sources
Disjoint dominating and total dominating sets in graphs
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning +3 more
openaire +2 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
A Note on Non-Dominating Set Partitions in Graphs
Discussiones Mathematicae Graph Theory, 2016 A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a vertex of S and is a total dominating set if every vertex of G is adjacent to a vertex of S.
Desormeaux Wyatt J. +2 more
doaj +1 more source
COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells
Molecular Oncology, EarlyView.This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos +6 more
wiley +1 more source
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +1 more source