Results 71 to 80 of about 177,806 (308)

Distance-Regular Graphs and Halved Graphs

open access: yesEuropean 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

Metastasis on pause: How dormant tumor cells stay hidden within the tumor microenvironment and evade immune surveillance

open access: yesMolecular 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

The relationship between the intrinsic Čech and persistence distortion distances for metric graphs

open access: yesJournal 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

Developmental programmes drive cellular plasticity, disease progression and therapy resistance in lung adenocarcinoma

open access: yesMolecular 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 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  

Stimulator of interferon genes agonist augmented antitumor immunity of osimertinib in Egfr‐mutated lung cancer

open access: yesMolecular 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

Structural Relationship of Isomorphic Graph and its Mapping to Hamming Distance [PDF]

open access: yesEPJ Web of Conferences
Mapping graph isomorphism to Hamming distance enables a simple yet effective approach to quantifying structural similarity. By encoding graphs as binary adjacency vectors—flattened from the upper triangle of the adjacency matrix—structural comparisons ...
Tiwari Monika   +3 more
doaj   +1 more source

Distance perfectness of graphs

open access: yesDiscussiones 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

Boolean distance for graphs

open access: yesDiscrete Mathematics, 1982
AbstractThe boolean distance between two points x and y of a connected graph G is defined as the set of all points on all paths joining x and y in G (Ø if x = y). It is determined in terms of the block-cutpoint graph of G, and shown to satisfy the triangle inequality b(x,y)⊆ b(x, z)∪b(z,y). We denote by B(G) the collection of distinct boolean distances
Frank Harary   +3 more
openaire   +3 more sources

Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma

open access: yesMolecular Oncology, EarlyView.
Bladder tumors with higher pretreatment memory B‐cell infiltration were linked to longer survival after cisplatin chemotherapy, but not carboplatin. These tumors also showed more organized immune structures (tertiary lymphoid structures) and a shared pro‐inflammatory B‐cell‐rich community, suggesting that memory B cells may help identify patients most ...
Konrad Stawiski   +10 more
wiley   +1 more source

Home - About - Disclaimer - Privacy