Results 131 to 140 of about 9,917,456 (366)
Genomics‐led approach to drug testing in models of undifferentiated pleomorphic sarcoma
GA text Genomic data from undifferentiated pleomorphic sarcoma patients and preclinical models were used to inform a targeted drug screen. Selected compounds were tested in 2D and 3D cultures of UPS cell lines. A combination of trametinib and infigratinib was synergistic in the majority of UPS cell lines tested, which was further confirmed in an ex ...
Piotr J. Manasterski +19 more
wiley +1 more source
Restrained captive domination number
The restrained captive domination number (RCDN), denoted by γRca(G),{\gamma }_{{\rm{Rca}}}(G), is a new definition of domination number in graphs introduced in this article.
Alrikabi Zainab Yasir +2 more
doaj +1 more source
A dynamic domination problem in trees [PDF]
We consider a dynamic domination problem for graphs in which an infinite sequence of attacks occur at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard. Other guards
William Klostermeyer, Christina Mynhardt
doaj
Trees with equal domination and tree-free domination numbers
A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). The minimum number of vertices of a dominating set in \(G\) is the domination number \(\gamma(G)\) of \(G\).
Haynes, Teresa W., Henning, Michael A.
openaire +4 more sources
A nucleotide‐independent, pan‐RAS‐targeted DARPin elicits anti‐tumor activity in a multimodal manner
We report a Designed Ankyrin Repeat Protein that binds and inhibits RAS proteins, which serve as central cell signaling hubs and are essential for the progression of many cancers. Its unique feature is that it does not discriminate between different RAS isoforms or mutations and is capable of binding to RAS in both its active (GTP‐bound) and inactive ...
Jonas N. Kapp +13 more
wiley +1 more source
Bounding the Locating-Total Domination Number of a Tree in Terms of Its Annihilation Number
Suppose G = (V,E) is a graph with no isolated vertex. A subset S of V is called a locating-total dominating set of G if every vertex in V is adjacent to a vertex in S, and for every pair of distinct vertices u and v in V −S, we have N(u) ∩ S ≠ N(v) ∩ S ...
Mei Lu, Wenjie Ning, Kun Wang
semanticscholar +1 more source
Overexpression of CHRDL2 in colon cancer cells makes them more stem‐like and resistant to chemo‐ and radiotherapy. CHRDL2‐high cells have upregulation of the WNT pathway, genes involved in the DNA damage response (DDR) pathway and epithelial‐to‐mesenchymal transition (EMT). This leads to quicker repair of damaged DNA and more cell migration.
Eloise Clarkson, Annabelle Lewis
wiley +1 more source
Fair Domination Number in Cactus Graphs
For k ≥ 1, a k-fair dominating set (or just kFD-set) in a graph G is a dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V \ S. The k-fair domination number of G, denoted by fdk(G), is the minimum cardinality of a kFD-set.
Majid Hajian, N. J. Rad
semanticscholar +1 more source
Analysis of treatment‐naïve high‐grade serous ovarian carcinoma (HGSOC) and control tissues for ERVs, LINE‐1 (L1), inflammation, and immune checkpoints identified five clusters with diverse patient recurrence‐free survivals. An inflammation score was calculated and correlated with retroelement expression, where one novel cluster (Triple‐I) with high ...
Laura Glossner +6 more
wiley +1 more source
Forcing Independent Domination Number of a Graph
In this paper, we obtain the forcing independent domination number of some special graphs. Further, we determine the forcing independent domination number of graphs under some binary operations such join, corona and lexicographic product of two graphs.
C. Armada, S. Canoy
semanticscholar +1 more source

