Results 101 to 110 of about 9,635,811 (355)
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
β‐TrCP overexpression enhances cisplatin sensitivity by depleting BRCA1
Low levels of β‐TrCP (Panel A) allow the accumulation of BRCA1 and CtIP, which facilitate the repair of cisplatin‐induced DNA damage via homologous recombination (HR) and promote tumor cell survival. In contrast, high β‐TrCP expression (Panel B) leads to BRCA1 and CtIP degradation, impairing HR repair, resulting in persistent DNA damage and apoptosis ...
Rocío Jiménez‐Guerrero +8 more
wiley +1 more source
The 2-domination number of cylindrical graphs [PDF]
José A. Martínez +2 more
openalex +1 more source
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
Nordhaus–Gaddum type inequalities on the total Italian domination number in graphs [PDF]
Seyed Mahmoud Sheikholeslami +1 more
openalex +1 more source
Irredundance number versus domination number
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
Rainbow game domination subdivision number of a graph [PDF]
The rainbow game domination subdivision number of a graph G is defined by the following game. Two players D and A, D playing first, alternately mark or subdivide an edge of G which is not yet marked nor subdivided.
J. Amjadi
doaj
Computing locating-total domination number in some rotationally symmetric graphs. [PDF]
Raza H, Iqbal N, Khan H, Botmart T.
europepmc +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

