Results 131 to 140 of about 1,217,256 (282)

Product throttling for power domination [PDF]

open access: yes, 2020
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number.
Trenk, Ann   +6 more
core  

Some necessary conditions for graphs with extremal connected 2-domination number [PDF]

open access: yesDiscrete Mathematics Letters
Piyawat Wongthongcue   +1 more
doaj   +1 more source

SPHINX31 acts as a SRPK1 inhibitor targeting the ATR/DNA‐PKcs/CHK1 replicative checkpoint to inhibit cell growth in non‐small cell lung cancer

open access: yesMolecular 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

Domination Numbers in Graphs Resulting from Shackle Operations with Linkage of any Graph

open access: yesJTAM (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

Hydrostatic pressure activates HIF‐1α via β‐catenin to promote stemness in breast cancer cells

open access: yesFEBS Open Bio, EarlyView.
To mimic the elevated intestinal fluid pressure in breast cancers, we loaded human breast cancer cells (MCF‐7, MDA‐MB‐453, and BT‐474) to 50 mmHg hydrostatic pressure. Hydrostatic pressure exposure upregulated HIF‐1α and induced stemness in MCF‐7 and BT‐474 cells.
Da Zhai   +8 more
wiley   +1 more source

Weakly connected domination critical graphs

open access: yes
Tyt. z nagł.References p. 330.Dostępny również w formie drukowanej.ABSTRACT: A dominating set [formula] a weakly connected dominating set in G if the subgraph G[D]w = (NG[D], Ew) weakly induced by D is connected, where Ew is the set of all edges with at ...
Lemańska, Magdalena.
core  

On graphs for which the connected domination number is at most the total domination number. Discrete [PDF]

open access: yes, 2012
In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Oliver Schaudt
core  

Aquaporin‐3 and aquaporin‐5 impact the development of pancreatic ductal adenocarcinoma spheroids

open access: yesFEBS 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

HT-graphs: centers, connected r-domination and Steiner trees [PDF]

open access: yesComputer 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  

Directed evolution of enzymes at the crossroads of tradition and innovation

open access: yesFEBS Open Bio, EarlyView.
An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy