Results 61 to 70 of about 159,188 (266)

On graphs with distance Laplacian eigenvalues of multiplicity n−4

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
Let G be a connected simple graph with n vertices. The distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the diagonal matrix of vertex transmissions and [Formula: see text] is the distance ...
Saleem Khan, S. Pirzada, A. Somasundaram
doaj   +1 more source

Genetic attenuation of ALDH1A1 increases metastatic potential and aggressiveness in colorectal cancer

open access: yesMolecular Oncology, EarlyView.
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova   +25 more
wiley   +1 more source

Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic.
Fábio Protti, Uéverton S. Souza
doaj   +1 more source

Targeted modulation of IGFL2‐AS1 reveals its translational potential in cervical adenocarcinoma

open access: yesMolecular Oncology, EarlyView.
Cervical adenocarcinoma patients face worse outcomes than squamous cell carcinoma counterparts despite similar treatment. The identification of IGFL2‐AS1's differential expression provides a molecular basis for distinguishing these histotypes, paving the way for personalized therapies and improved survival in vulnerable populations globally.
Ricardo Cesar Cintra   +6 more
wiley   +1 more source

The walk distances in graphs

open access: yesDiscrete Applied Mathematics, 2012
Accepted for publication in Discrete Applied Mathematics.
openaire   +2 more sources

RIPK4 function interferes with melanoma cell adhesion and metastasis

open access: yesMolecular Oncology, EarlyView.
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

COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells

open access: yesMolecular Oncology, EarlyView.
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

On the distance eigenvalues of Cayley graphs

open access: yesپژوهش‌های ریاضی, 2022
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  

Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer

open access: yesMolecular Oncology, EarlyView.
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

On Wiener index of graph complements [PDF]

open access: yesTransactions on Combinatorics, 2014
Let $G$ be an $(n,m)$-graph. We say that $G$ has property $(ast)$ if for every pair of its adjacent vertices $x$ and $y$, there exists a vertex $z$, such that $z$ is not adjacent to either $x$ or $y$.
Jaisankar Senbagamalar   +2 more
doaj  

Home - About - Disclaimer - Privacy