Results 51 to 60 of about 322,612 (279)
On 3-Chromatic Distance-Regular Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blokhuis , A. +2 more
openaire +11 more sources
RIPK4 function interferes with melanoma cell adhesion and metastasis
RIPK4 promotes melanoma growth and spread. RIPK4 levels increase as skin lesions progress to melanoma. CRISPR/Cas9‐mediated deletion of RIPK4 causes melanoma cells to form less compact spheroids, reduces their migratory and invasive abilities and limits tumour growth and dissemination in mouse models.
Norbert Wronski +9 more
wiley +1 more source
Distance equienergetic graphs of diameter 4
Let Γ1, Γ2 and Γ3 be graphs with pairwise disjoint vertex sets. The graph Θ(Γ1,Γ2,Γ3) is obtained from the graphs Γ1∘Γ3 (the corona product) and Γ2 by joining each vertices of Γ1 in Γ1∘Γ3 with every vertices in Γ2.
B.J. Manjunatha +2 more
doaj +1 more source
We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones.
C. Dalfo, M. A. Fiol, M. Mitjana
doaj +1 more source
Addressing graph products and distance-regular graphs
Graham and Pollak showed that the vertices of any connected graph $G$ can be assigned $t$-tuples with entries in $\{0, a, b\}$, called addresses, such that the distance in $G$ between any two vertices equals the number of positions in their addresses where one of the addresses equals $a$ and the other equals $b$.
Sebastian M. Cioabă +4 more
openaire +3 more sources
COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells
This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos +6 more
wiley +1 more source
Distance-Locally Disconnected Graphs
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
Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer
COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann +61 more
wiley +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
The distance spectrum of corona and cluster of two graphs
Let G be a connected graph with a distance matrix D. The D-eigenvalues {μ1,μ2,…,…,μp} of G are the eigenvalues of D and form the distance spectrum or D-spectrum of G.
G. Indulal, Dragan Stevanović
doaj +1 more source

