Results 121 to 130 of about 9,917,456 (366)
Molecular Oncology, EarlyView.This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani +14 more
wiley +1 more source
Rainbow game domination subdivision number of a graph [PDF]
Romanian Journal of Mathematics and Computer Science, 2014 The rainbow game domination subdivision number of a graph G is defined by the following game. Two players D and A, D playing first, alternately mark or subdivide an edge of G which is not yet marked nor subdivided.
J. Amjadi
doaj
Graphs With Large Semipaired Domination Number
Discussiones Mathematicae Graph Theory, 2019 Let G be a graph with vertex set V and no isolated vertices. A sub-set S ⊆ V is a semipaired dominating set of G if every vertex in V \ S is adjacent to a vertex in S and S can be partitioned into two element subsets such that the vertices in each subset
T. Haynes, Michael A. Henning
semanticscholar +1 more source
Molecular Oncology, EarlyView.mir‐196a promotes Esophagus Adenocarcinoma aggressiveness. On one hand, mir‐196a targets the valosin‐containing protein (VCP) mRNA, causing the accumulation of c‐MYC protein that leads to high amounts of TERT. On the other hand, mir‐196a targets the inhibitor of NFκB (NFKBIA).
Jesús García‐Castillo +8 more
wiley +1 more source
Computing locating-total domination number in some rotationally symmetric graphs. [PDF]
Sci Prog, 2021 Raza H, Iqbal N, Khan H, Botmart T.
europepmc +1 more source
On the Secure Total Domination Number of Graphs
Symmetry, 2019 A total dominating set D of a graph G is said to be a secure total dominating set if for every vertex u ∈ V ( G ) \ D , there exists a vertex v ∈ D , which is adjacent to u, such that ( D \ { v } ) ∪ { u } is a total dominating set as well.
Abel Cabrera Martínez +2 more
semanticscholar +1 more source
Irredundance number versus domination number
Discrete Mathematics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Molecular Oncology, EarlyView.The pan‐HDAC inhibitor belinostat increases the expression of the pro‐apoptotic proteins Bim, Puma, and Noxa and induces apoptosis in ovarian cancer cell lines and patient‐derived tumor organoids when used at high concentrations. Moreover, inhibiting the anti‐apoptotic proteins Bcl‐xL or Mcl‐1 sensitizes these preclinical models to the cytotoxic effect
Cécilia Thomine +10 more
wiley +1 more source
The Slater and Sub-k-Domination Number of a Graph with Applications to Domination and k-Domination
Discussiones Mathematicae Graph Theory, 2020 In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph G, called the sub-k-domination number and denoted subk(G).
Amos David +3 more
doaj +1 more source
Characterization of graphs with equal domination and connected domination numbers
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang Sun, Hua-Ming Xing, Xue-Gang Chen
openaire +3 more sources