Results 81 to 90 of about 11,484 (286)
Molecular Oncology, EarlyView.AZD9291 has shown promise in targeted cancer therapy but is limited by resistance. In this study, we employed metabolic labeling and LC–MS/MS to profile time‐resolved nascent protein perturbations, allowing dynamic tracking of drug‐responsive proteins. We demonstrated that increased NNMT expression is associated with drug resistance, highlighting NNMT ...
Zhanwu Hou +5 more
wiley +1 more source
Total Roman Reinforcement in Graphs
Discussiones Mathematicae Graph Theory, 2019 A total Roman dominating function on a graph G is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2 and the subgraph of G induced by the set of all vertices of positive weight has no isolated vertex.
Ahangar H. Abdollahzadeh +4 more
doaj +1 more source
Total domination and total domination subdivision number of a graph and its complement
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Favaron, O. +2 more
openaire +2 more sources
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source
Equality in a Linear Vizing-Like Relation that Relates the Size and Total Domination Number of a Graph [PDF]
, 2011 Michael A. Henning, Ernst J. Joubert
openalex +2 more sources
Computing locating-total domination number in some rotationally symmetric graphs. [PDF]
Sci Prog, 2021 Raza H, Iqbal N, Khan H, Botmart T.
europepmc +1 more source
Total domination subdivision numbers of graphs
Discussiones Mathematicae Graph Theory, 2004 Summary: A set \(S\) of vertices in a graph \(G=(V,E)\) is a total dominating set of \(G\) if every vertex of \(V\) is adjacent to a vertex in \(S\). The total domination number of \(G\) is the minimum cardinality of a total dominating set of \(G\). The total domination subdivision number of \(G\) is the minimum number of edges that must be subdivided (
Haynes, Teresa W. +2 more
openaire +2 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
Quasi total double Roman domination in graphs
AKCE International Journal of Graphs and CombinatoricsA quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w
S. Kosari +4 more
doaj +1 more source
Inequalities involving independence domination, f-domination, connected and total f-domination numbers [PDF]
Czechoslovak Mathematical Journal, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source