Results 81 to 90 of about 1,232,284 (259)
On the Wiener index of two families generated by joining a graph to a tree [PDF]
Andrey A. Dobrynin
doaj +1 more source
Clinical analysis reveals significant dysregulation of FGFRL1 in esophageal cancer (EC) patients. RNAi‐coupled next‐generation sequencing (NGS) and in vitro study reveal FGFRL1‐mediated EC progression via EMT, PI3K/Akt, and Notch pathways. Functional assays confirm its role in tumor growth, migration, and invasion.
Aprajita Srivastava +3 more
wiley +1 more source
We investigated the toxicity of 12 active compounds commonly found in herbal weight loss supplements (WLS) using human liver and colon cell models. Epigallocatechin‐3‐gallate was the only compound showing significant toxicity. Metabolic profiling revealed protein degradation, disrupted energy and lipid metabolism suggesting that the inclusion of EGCG ...
Emily C. Davies +3 more
wiley +1 more source
On Subgraphs in Distance-Regular Graphs [PDF]
A graph is distance-regular when it is simple and for any two vertices at distance \(j\), the numbers of vertices adjacent to one and at distance \(j- 1\) (resp. \(j\) and \(j+1)\) of the other are constant (depending on \(j\) only). First some necessary conditions are derived for distance- regularity of the subgraph of the geodesics joining two ...
openaire +3 more sources
dUTPases are involved in balancing the appropriate nucleotide pools. We showed that dUTPase is essential for normal development in zebrafish. The different zebrafish genomes contain several single‐nucleotide variations (SNPs) of the dut gene. One of the dUTPase variants displayed drastically lower protein stability and catalytic efficiency as compared ...
Viktória Perey‐Simon +6 more
wiley +1 more source
On the distance eigenvalues of Cayley graphs
In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
Structural Relationship of Isomorphic Graph and its Mapping to Hamming Distance [PDF]
Mapping graph isomorphism to Hamming distance enables a simple yet effective approach to quantifying structural similarity. By encoding graphs as binary adjacency vectors—flattened from the upper triangle of the adjacency matrix—structural comparisons ...
Tiwari Monika +3 more
doaj +1 more source
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
On the connectivity of $k$-distance graphs
For any $k \in \mathbb{N}$, the $k-$distance graph $D^{k}G$ has the same vertex set of $G$, and two vertices of $D^{k}G$ are adjacent if they are exactly distance $k$ apart in the original graph $G$. In this paper, we consider the connectivity of $D^{k}G$
Omid Khormali
doaj +1 more source
Functional Connectivity Linked to Cognitive Recovery After Minor Stroke
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri +7 more
wiley +1 more source

