Results 121 to 130 of about 366,581 (319)
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G ...
Natarajan C., Ayyaswamy S.K.
doaj +1 more source
Molecular Oncology, EarlyView.Clinical trials on PARP inhibitors in urothelial carcinoma (UC) showed limited efficacy and a lack of predictive biomarkers. We propose SLFN5, SLFN11, and OAS1 as UC‐specific response predictors. We suggest Talazoparib as the better PARP inhibitor for UC than Olaparib.
Jutta Schmitz +15 more
wiley +1 more source
Locating-Total Domination Number in Strong Product of Two Paths
, 2020 Wei Kang, Jianping Li, Zhemin Li
openalex +2 more sources
Signed total Roman domination in graphs
Journal of Combinatorial Optimization, 2015 Published by De Gruyter Open ...
openaire +4 more sources
Molecular Oncology, EarlyView.HDAC4 is degraded by the E3 ligase FBXW7. In colorectal cancer, FBXW7 mutations prevent HDAC4 degradation, leading to oxaliplatin resistance. Forced degradation of HDAC4 using a PROTAC compound restores drug sensitivity by resetting the super‐enhancer landscape, reprogramming the epigenetic state of FBXW7‐mutated cells to resemble oxaliplatin ...
Vanessa Tolotto +13 more
wiley +1 more source
Signed total strong Roman domination in graphs [PDF]
Discrete Mathematics Letters, 2022 Maryam Hajjari +1 more
doaj +1 more source
Partial Total Domination in Hypergraphs
MathematicsThis paper establishes fundamental results for partial total domination in hypergraphs. We present tight bounds for the partial total domination number in k-uniform hypergraphs, demonstrate relationships with classical domination parameters, and provide ...
Abdulkafi Sanad, Chaoqian Li
doaj +1 more source
Characterization of Cubic Graphs G with irt(G) = Irt(G) = 2
Discussiones Mathematicae Graph Theory, 2014 A subset S of vertices in a graph G is called a total irredundant set if, for each vertex v in G, v or one of its neighbors has no neighbor in S −{v}. The total irredundance number, ir(G), is the minimum cardinality of a maximal total irredundant set of ...
Eslahchi Changiz +2 more
doaj +1 more source
Molecular Oncology, EarlyView.Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra +10 more
wiley +1 more source
Equitable power domination number of total graph of certain graphs
, 2020 S. Banu Priya, A. Parthiban, P. Abirami
openalex +1 more source