Results 141 to 150 of about 9,917,456 (366)
On edge domination numbers of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Cotargeting EGFR and STAT3 with Erlotinib and TTI‐101 impairs both 2D and 3D growth of ETV1‐overexpressing prostate cancer cells by disrupting a self‐sustaining ETV1–EGFR positive feedback loop that promotes EGFR and STAT3 expression and phosphorylation (activation).
Elsa Gomes Paiva +5 more
wiley +1 more source
Human cytomegalovirus infection is common in normal prostate epithelium, prostate tumor tissue, and prostate cancer cell lines. CMV promotes cell survival, proliferation, and androgen receptor signaling. Anti‐CMV pharmaceutical compounds in clinical use inhibited cell expansion in prostate cancer models in vitro and in vivo, motivating investigation ...
Johanna Classon +13 more
wiley +1 more source
The 2-domination and Roman domination numbers of grid graphs
We investigate the 2-domination number for grid graphs, that is the size of a smallest set $D$ of vertices of the grid such that each vertex of the grid belongs to $D$ or has at least two neighbours in $D$. We give a closed formula giving the 2-domination number of any $n \!\times\! m$ grid, hereby confirming the results found by Lu and Xu, and Shaheen
Rao, Michaël, Talon, Alexandre
openaire +6 more sources
In luminal (ER+) breast carcinoma (BC), miRNA profiling identified miR‐195‐5p as a key regulator of proliferation that targets CHEK1, CDC25A, and CCNE1. High CHEK1 expression correlates with worse relapse‐free survival after chemotherapy, especially in patients with luminal A subtype.
Veronika Boušková +14 more
wiley +1 more source
Total Domination Multisubdivision Number of a Graph
The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G.
Avella-Alaminos Diana +3 more
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
On graphs whose domination numbers equal their independent domination numbers
Abstract In this paper, we extend a result due to R. B. Allan and R. C. Laskar on graphs whose independent domination numbers equal their domination numbers. We will consider finite simple graphs as treated in most of the standard text-books on Graph Theory (e.g., see D. B. West [1]). Let G = (V,E) be any graph and D ⊆ V. We let N(D) denote the set
Purnima Gupta, B. D. Acharya
openaire +2 more sources
In thyroid cancer patients, high‐dose (≥7.4 GBq) radioactive iodine therapy (RAIT) was associated with a higher prevalence of clonal hematopoiesis (variant allele frequency >2%) in individuals aged ≥50 years (OR = 2.44). In silico analyses showed that truncating PPM1D mutations conferred a selective advantage under these conditions.
Jaeryuk Kim +11 more
wiley +1 more source

