Results 111 to 120 of about 9,635,811 (355)
Trees with equal total domination and game total domination numbers
Discrete Applied Mathematics, 2017 23 pages, 5 figures, 22 ...
Henning, Michael A., Rall, Douglas F.
openaire +3 more sources
Bridging the gap: Multi‐stakeholder perspectives of molecular diagnostics in oncology
Molecular Oncology, EarlyView.Although molecular diagnostics is transforming cancer care, implementing novel technologies remains challenging. This study identifies unmet needs and technology requirements through a two‐step stakeholder involvement. Liquid biopsies for monitoring applications and predictive biomarker testing emerge as key unmet needs. Technology requirements vary by
Jorine Arnouts +8 more
wiley +1 more source
The secure domination number of Cartesian products of small graphs with paths and cycles [PDF]
, 2021 Michael Haythorpe, Alex Newcombe
openalex +1 more source
Bounding the Locating-Total Domination Number of a Tree in Terms of Its Annihilation Number
Discussiones Mathematicae Graph Theory, 2019 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
YAP1::TFE3 mediates endothelial‐to‐mesenchymal plasticity in epithelioid hemangioendothelioma
Molecular Oncology, EarlyView.The YAP1::TFE3 fusion protein drives endothelial‐to‐mesenchymal transition (EndMT) plasticity, resulting in the loss of endothelial characteristics and gain of mesenchymal‐like properties, including resistance to anoikis, increased migratory capacity, and loss of contact growth inhibition in endothelial cells.
Ant Murphy +9 more
wiley +1 more source
Restrained captive domination number
Open EngineeringThe 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]
Transactions on Combinatorics, 2015 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
The Slater and Sub-k-Domination Number of a Graph with Applications to Domination and k-Domination
Discussiones Mathematicae Graph Theory, 2020 In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph G, called the sub-k-domination number and denoted subk(G).
Amos David +3 more
doaj +1 more source
Modeling hepatic fibrosis in TP53 knockout iPSC‐derived human liver organoids
Molecular Oncology, EarlyView.This study developed iPSC‐derived human liver organoids with TP53 gene knockout to model human liver fibrosis. These organoids showed elevated myofibroblast activation, early disease markers, and advanced fibrotic hallmarks. The use of profibrotic differentiation medium further amplified the fibrotic signature seen in the organoids.
Mustafa Karabicici +8 more
wiley +1 more source