Results 41 to 50 of about 1,430 (216)

Distance Critical Graphs

open access: yesGraphs and Combinatorics
Abstract In 1971, Graham and Pollak provided a formula for the determinant of the distance matrix of any tree on n vertices. Yan and Yeh reproved this by exploiting the fact that pendant vertices can be deleted from trees without changing the remaining entries of the distance matrix.
Joshua N. Cooper, Gabrielle Tauscheck
openaire   +3 more sources

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

On Some Distance Spectral Characteristics of Trees

open access: yesAxioms
Graham and Pollack in 1971 presented applications of eigenvalues of the distance matrix in addressing problems in data communication systems. Spectral graph theory employs tools from linear algebra to retrieve the properties of a graph from the spectrum ...
Sakander Hayat   +2 more
doaj   +1 more source

Distance 2-Domination in Prisms of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
A set of vertices D of a graph G is a distance 2-dominating set of G if the distance between each vertex u ∊ (V (G) − D) and D is at most two. Let γ2(G) denote the size of a smallest distance 2-dominating set of G. For any permutation π of the vertex set
Hurtado Ferran   +3 more
doaj   +1 more source

The walk distances in graphs

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

Distance-Regular Graphs

open access: yesThe Electronic Journal of Combinatorics, 2016
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin,
Edwin R. van Dam   +2 more
openaire   +4 more sources

Spectral distances on graphs [PDF]

open access: yesDiscrete Applied Mathematics, 2015
25 pages, 12 ...
Jiao Gu, Bobo Hua, Shiping Liu
openaire   +3 more sources

Spatial and single‐nuclei transcriptomics reveals idiosyncratic and generic patterns in papillary and anaplastic thyroid cancers

open access: yesMolecular Oncology, EarlyView.
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur   +11 more
wiley   +1 more source

Variation of sum of two largest eigenvalues of the distance matrices of four-leaf graph

open access: yesJournal of Hebei University of Science and Technology, 2020
In order to accurately obtain the extremum of the distance eigenvalues of fowr-leaf graphs under tow graph transformations in any case, two graph transformations of four-leaf graphs and the results of the above problems were given by using the properties
Zhe LYU, Yubin GAO
doaj   +1 more source

Home - About - Disclaimer - Privacy