Results 61 to 70 of about 114,426,441 (303)
Information Sciences, 2018 Ministerio de Ciencia e Innovación ECO2013-17766 ...
José Manuel, Gallardo +2 more
openaire +4 more sources
Molecular Oncology, EarlyView.Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 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]
Discrete 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
On graphs with distance Laplacian eigenvalues of multiplicity n−4
AKCE 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
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
On the Wiener index of two families generated by joining a graph to a tree [PDF]
Discrete Mathematics Letters, 2022 Andrey A. Dobrynin
doaj +1 more source
Spectral distances on graphs [PDF]
Discrete Applied Mathematics, 2015 25 pages, 12 ...
Jiao Gu, Bobo Hua, Shiping Liu
openaire +3 more sources
Molecular Oncology, EarlyView.Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura +19 more
wiley +1 more source
Distance-Regular Graphs and Halved Graphs
European Journal of Combinatorics, 1986 Let G be a bipartite distance-regular graph with bipartition \(V(G)=X\cup Y\). Let \(V(G')=X\) and, for x and y in X, let x be adjacent to y in G' if and only if x is of distance two from y in G. Then G' is called a halved graph of G, and is distance-regular. This paper discusses whether G' is one of the known, large-diameter, distance-regular graphs.
openaire +3 more sources
On the rotation distance of graphs
Discrete Mathematics, 1994 Let \(G\) be a simple undirected graph and suppose that \((x,y)\in E(G)\) and \((x,y')\not\in E(G)\). Then the rotation of \((x,y)\) about \(x\), denoted by \(r= (y,x,y')\) is the operation of removing \((x,y)\) and inserting \((x,y')\) as an edge. The resulting graph is denoted by \(G(r)\). A graph \(G\) can be rotated into a graph \(H\) if there is a
Ralph J. Faudree +4 more
openaire +2 more sources