Results 61 to 70 of about 166,278 (263)
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.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
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Milan Pokorný +3 more
openaire +3 more sources
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
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 +2 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
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
On the distance eigenvalues of Cayley graphs
پژوهشهای ریاضی, 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
The relationship between the intrinsic Čech and persistence distortion distances for metric graphs
Journal of Computational Geometry, 2019 Metric graphs are meaningful objects for modeling complex structures that arise in many real-world applications, such as road networks, river systems, earthquake faults, blood vessels, and filamentary structures in galaxies.
Ellen Gasparovic +6 more
doaj +1 more source
Distance perfectness of graphs
Discussiones Mathematicae Graph Theory, 1999 The author introduces a new generalization of perfect graphs. It turns out that the analogue of the weak perfect graph theorem is not true for this generalization. A subset \(Q\) of the vertex set \(V\) of a graph \(G\) is a \(k\)-distance clique in \(G\) if \(d_G(x,y)\leq k\) for any \(x,y\in Q\) and \(\langle Q\rangle_G\), the subgraph of \(G ...
openaire +1 more source