Results 101 to 110 of about 9,423,140 (336)
Total and Double Total Domination Number on Hexagonal Grid
In this paper, we determine the upper and lower bound for the total domination number and exact values and the upper bound for the double-total domination number on hexagonal grid H m , n with m hexagons in a row and n hexagons in a column.
A. Klobucar, A. Klobučar
semanticscholar +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
Cancer‐associated fibroblasts (CAFs) promote cancer growth, invasion (metastasis), and drug resistance. Here, we identified functional and diverse circulating CAFs (cCAFs) in patients with metastatic prostate cancer (mPCa). cCAFs were found in higher numbers and were functional and diverse in mPCa patients versus healthy individuals, suggesting their ...
Richell Booijink+6 more
wiley +1 more source
Domination Number and Secure Resolving Sets in Cyclic Networks
Basma Mohamed, Mohamed Amin
semanticscholar +1 more source
Graphs With Large Semipaired Domination Number
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
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
Peripheral blood proteome biomarkers distinguish immunosuppressive features of cancer progression
Immune status significantly influences cancer progression. This study used plasma proteomics to analyze benign 67NR and malignant 4T1 breast tumor models at early and late tumor stages. Immune‐related proteins–osteopontin (Spp1), lactotransferrin (Ltf), calreticulin (Calr) and peroxiredoxin 2 (Prdx2)–were associated with systemic myeloid‐derived ...
Yeon Ji Park+6 more
wiley +1 more source
Adverse prognosis gene expression patterns in metastatic castration‐resistant prostate cancer
We aggregated a cohort of 1012 mCRPC tissue samples from 769 patients and investigated the association of gene expression‐based pathways with clinical outcomes. Loss of AR signaling, high proliferation, and a glycolytic phenotype were independently prognostic for poor outcomes, and an adverse transcriptional feature score incorporating these pathways ...
Marina N. Sharifi+26 more
wiley +1 more source
On the Game Total Domination Number [PDF]
11 ...
openaire +3 more sources
TOMM20 increases cancer aggressiveness by maintaining a reduced state with increased NADH and NADPH levels, oxidative phosphorylation (OXPHOS), and apoptosis resistance while reducing reactive oxygen species (ROS) levels. Conversely, CRISPR‐Cas9 knockdown of TOMM20 alters these cancer‐aggressive traits.
Ranakul Islam+9 more
wiley +1 more source