Results 111 to 120 of about 1,258,349 (257)
On the doubly connected domination polynomial of a graph
, 2019 Let [Formula: see text] be a simple graph. A set [Formula: see text] is a doubly connected dominating set of [Formula: see text] if it is a dominating set and both induced subgraphs [Formula: see text] and [Formula: see text] are connected.
M. Arslanov, F. Movahedi, M. H. Akhbari
core +1 more source
Domination Numbers in Graphs Resulting from Shackle Operations with Linkage of any Graph
JTAM (Jurnal Teori dan Aplikasi Matematika)The domination number is the number of dominating nodes in a graph that can dominate the surrounding connected nodes with a minimum number of dominating nodes. This domini number is denoted by γ(G). In this research, we will examine the domination number
Ilham Saifudin +3 more
doaj +1 more source
Molecular Oncology, EarlyView.The kinase SRPK1 directly interacts with the protein TOPBP1 and regulates the pre‐mRNA splicing of WIZ thereby contributing to the activation of the ATR/CHK1 replicative checkpoint in response to replicative stress. This allows cancer cells' genomic stability and survival.
Amani Shreim +17 more
wiley +1 more source
Connected Domination in Plane Triangulations [PDF]
A set of vertices of a graph $G$ such that each vertex of $G$ is either in the set or is adjacent to a vertex in the set is called a dominating set of $G$.
Pavelescu, Elena, Bryant, Felicity
core
Targeting the EpCAM‐AXL axis to overcome drug resistance in lung cancer
Molecular Oncology, EarlyView.Lung cancer cells often evade therapy by hijacking signaling pathways. We reveal that cleaved EpCAM (sEpCAM) stabilizes the oncogenic protein AXL, driving NF‐κB and STAT3‐mediated chemoresistance. This EpCAM‐AXL axis identifies a high‐risk patient subset with poor prognosis.
Alexa Guerrero‐Alba +5 more
wiley +1 more source
Open MathematicsLet T(X) be a full transformation semigroup on a nonempty set X. The Cayley digraph Γ of a semigroup T(X) with respect to the Green’s L $\mathcal{L}$ -class is a digraph with vertex set T(X) and two vertices α, β ∈ T(X) are adjacent as an arc (α, β ...
Chaiya Yanisa +2 more
doaj +1 more source
HT-graphs: centers, connected r-domination and Steiner trees [PDF]
Computer Science Journal of Moldova, 1993 HT-graphs have been introduced in [11] and investigated with respect to location problems on graphs. In this paper two new characterizations of these graphs are given and then it is shown that the central vertex, connected r-domination and Steiner trees ...
F. Dragan
doaj
USP7 inhibits FOXO1 activity in chronic lymphocytic leukaemia cells enhancing cell survival
Molecular Oncology, EarlyView.CLL cells rely on BCR‐mediated signalling for survival and proliferation in part through suppression of FOXO1. FOXO1 activity is regulated by a plethora of post‐translational modifications including phosphorylation and ubiquitination. We demonstrated that dual inhibition of BCR signalling and the deubiquitinase USP7 activates FOXO1, modulating its ...
Hassan N.B. Almuhanna +8 more
wiley +1 more source
Doubly connected edge domination number of a graph.
, 2015 A set F of a graph is an edge dominating set if every edge in is adjacent to some edge in F. An edge domination number of G is the minimum cardinality of an edge dominating set. An edge dominating set F is called a doubly connected edge dominating set
Venkanagouda, M.G. +2 more
core +1 more source
Aquaporin‐3 and aquaporin‐5 impact the development of pancreatic ductal adenocarcinoma spheroids
FEBS Open Bio, EarlyView.Schematic representation of the role of aquaporin‐3 (AQP3) and aquaporin‐5 (AQP5) in pancreatic ductal adenocarcinoma (PDAC). Both proteins are upregulated in PDAC and are associated with tumor progression and metastatic potential. Silencing AQP3 or AQP5 in PDAC spheroids results in decreased diameter, area, and overall growth, underscoring their key ...
Catarina Pimpão +3 more
wiley +1 more source