Results 131 to 140 of about 390,323 (304)
An upper bound on the independence number of benzenoid systems
Recently, the graph theoretic independence number has been linked to fullerene stability [S. Fajtlowicz, C. Larson, Graph-theoretic independence as a predictor of fullerene stability, Chem. Phys. Lett. 377 (2003) 485–490; S.
Pepper, Ryan
core +1 more source
Drosophila park mutants serve as a model for Parkinson's disease. We used this strain to investigate the connection between oxidative stress and the circadian clock mechanism. We showed that increased oxidative stress affects the physiology of pacemaker cells, disrupting their daily structural plasticity. Lack of rhythmic signaling from pacemaker cells
Kamila Zientara +3 more
wiley +1 more source
Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis
Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee +7 more
wiley +1 more source
CT10 regulator of kinase (CRK) and CRK‐Like (CRKL) are signaling adaptors driving cell adhesion, motility, differentiation, and proliferation. SH2‐domain containing (SH) proteins are enriched in YXXP motifs which when phosphorylated create preferred binding sites for CRK family SH2 domains.
Phoebe M. Cousens +8 more
wiley +1 more source
Independence number of iterated line digraphs
In this paper, we deal with the independence number of iterated line digraphs of a regular digraph G. We give pertinent lower bounds and give an asymptotic estimation of the ratio of the number of vertices of a largest independent set of the nth iterated
Lichiardopol, Nicolas
core +1 more source
Extremal k-Connected Graphs with Maximum Closeness
Closeness is a measure that quantifies how quickly information can spread from a given node to all other nodes in the network, reflecting the efficiency of communication within the network by indicating how close a node is to all other nodes. For a graph
Fazal Hayat, Daniele Ettore Otera
doaj +1 more source
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
Large Immersions in Graphs with Independence Number 3 and 4
TEXTO COMPLETO EN INGLÉSThe analogue of Hadwiger's conjecture for the immersion order, a conjecture independently posed by Lescure and Meyniel, and by Abu-Khzam and Langston, states that every graph G which does not contain the complete graph Kt+1 as an ...
Stein, M. +3 more
core +1 more source
Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat +8 more
wiley +1 more source
On the Independence Number of 1-Planar Graphs [PDF]
An independent set in a graph is a set of vertices where no two vertices are adjacent to each other. A maximum independent set is the largest possible independent set that can be formed within a given graph G.
Bose, Prosenjit +2 more
core +1 more source

