Results 81 to 90 of about 41,123 (303)
Distance regularity of compositions of graphs
Applied Mathematics Letters, 2004 The strong sum of graphs \(G_1\) and \(G_2\), \( G_1 \oplus G_2 \), is the graph whose vertex set is the Cartesian product \(V(G_1) \times V(G_2)\), and \((u_1,v_1)\) is adjacent to \((u_2,v_2)\) if \(u_1\) is adjacent to \(u_2\) and \(v_1\) is adjacent to \(v_2\) or if \(u_1\) is adjacent to \(u_2\) and \(v_1 = v_2\).
openaire +2 more sources
Molecular Oncology, EarlyView.LUNAR is a liver‐specific long noncoding RNA (lncRNA) that is highly expressed in normal liver but becomes epigenetically silenced in hepatocellular carcinoma through promoter hypermethylation. Loss of LUNAR is associated with NOTCH activation, epithelial–mesenchymal transition, and metastasis, whereas restoring LUNAR restrains metastatic progression ...
Se Ha Jang +9 more
wiley +1 more source
A conjecture of Biggs concerning the resistance of a distance-regular graph [PDF]
, 2019 Biggs conjectured that the resistance between any two points on a distance-regular graph of valency greater than 2 is bounded by twice the resistance between adjacent points.
Markowsky, G, Koolen, J
core +1 more source
Molecular Oncology, EarlyView.Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley +1 more source
Distance-Locally Disconnected Graphs
Discussiones Mathematicae Graph Theory, 2013 For an integer k ≥ 1, we say that a (finite simple undirected) graph G is k-distance-locally disconnected, or simply k-locally disconnected if, for any x ∈ V (G), the set of vertices at distance at least 1 and at most k from x induces in G a disconnected
Miller Mirka +2 more
doaj +1 more source
An Application of a Construction Theory of Strongly Closed Subgraphs in a Distance-regular Graph [PDF]
, 1999 Let Γ be a distance-regular graph with (c1,b1) =⋯=(cr,br) ≠ (cr+1,br+1)= ⋯=(c2r,b2r) wherer≥ 2 andcr+1>1.
Hiraki, A.
core +1 more source
CEACAM1 participation in breast cancer progression
Molecular Oncology, EarlyView.In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin +3 more
wiley +1 more source
FEBS Open Bio, EarlyView.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
Research on 7-distance set with DG(XD)=C11
Journal of Hebei University of Science and Technology, 2016 A planar point set X is called a k-distance set if there are exactly k distances between two distinct points in X. Let d(x,y) be the distance of any two distinct points x,y. Let diameter D=D(X) be the longest distance of X.
Qi WANG, Yue CONG, Feixing GAO
doaj +1 more source
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source