Results 121 to 130 of about 368,632 (278)
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
Semitotal domination versus domination and total domination in trees
RAIRO - Operations ResearchA set S of vertices in G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex of S. The semitotal domination number, γt2(G), is the minimum cardinality of a semitotal dominating set of G. Clearly, γ(G) ≤ γt2(G) ≤ γt(G). In this paper, for any nontrivial tree T that is not a star,
openaire +2 more sources
Molecular Oncology, EarlyView.Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova +25 more
wiley +1 more source
Signed total Italian domination in digraphs
, 2020 Published by Azabaijan Shahid Madani University, Azarshahr ...
openaire +5 more sources
Molecular Oncology, EarlyView.Dimethyl fumarate (DMF) reduces growth of HPV‐positive cervical cancer spheroids and induces ferroptosis in cervical cancer cells via blocking SLC7A11/Glutathione (GSH) axis. Combination of subcytotoxic doses of DMF and cisplatin (CDDP) further suppresses spheroid growth and drives cell death in 2D culture models.
Carolina Punziano +6 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
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
Signed total Roman domination in graphs
Journal of Combinatorial Optimization, 2015 Published by De Gruyter Open ...
openaire +4 more sources
Targeted modulation of IGFL2‐AS1 reveals its translational potential in cervical adenocarcinoma
Molecular Oncology, EarlyView.Cervical adenocarcinoma patients face worse outcomes than squamous cell carcinoma counterparts despite similar treatment. The identification of IGFL2‐AS1's differential expression provides a molecular basis for distinguishing these histotypes, paving the way for personalized therapies and improved survival in vulnerable populations globally.
Ricardo Cesar Cintra +6 more
wiley +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