Results 71 to 80 of about 17,894 (263)
Reconstruction of infinite graphs
Discrete Mathematics, 1991 The paper surveys results concerning reconstruction and edge- reconstructon of infinite graphs and draws attention to several interesting unsolved problems.
openaire +2 more sources
Molecular Oncology, EarlyView.We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric +10 more
wiley +1 more source
An advance in infinite graph models for the analysis of transportation networks
International Journal of Applied Mathematics and Computer Science, 2016 This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph.
Cera Martín, Fedriani Eugenio M.
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1988 Embeddings of infinite graphs in surfaces (not necessarily compact) without boundary are considered. Cellular embeddings are studied in details. Each rotation system of a locally finite graph G gives rise to a cellular embedding of G into some surface, and every cellular embedding with all 2-cells of finite size can be obtained in this way.
openaire +2 more sources
Molecular Oncology, EarlyView.In the present work, we have identified a transcriptional signature based on the differential expression of six genes (BCL2&MAST4, HSH2D&LAT2, METRN&PITPNM2) that would facilitate the early detection of T‐cell acute lymphoblastic leukemia (T‐ALL) patients prone to a poor treatment response and could be implemented at diagnosis, along with other risk ...
Antonio Lahera +11 more
wiley +1 more source
Electronic Journal of Graph Theory and ApplicationsIn this paper we introduce an intersection graph of a graph G, with vertex set the minimum edge-cuts of G. We find the minimum cut-set graphs of some well-known families of graphs and study the mincut graph as a graph operator.
Christo Kriel, Eunice Mphako-Banda
doaj +1 more source
Isoscattering strings of concatenating graphs and networks
Scientific Reports, 2021 We identify and investigate isoscattering strings of concatenating quantum graphs possessing n units and 2n infinite external leads. We give an insight into the principles of designing large graphs and networks for which the isoscattering properties are ...
Michał Ławniczak +3 more
doaj +1 more source
CCDC80 suppresses high‐grade serous ovarian cancer migration via negative regulation of B7‐H3
Molecular Oncology, EarlyView.PAX8 is a lineage‐specific master regulator of transcription in high‐grade serous ovarian cancer (HGSC) progression. We show for the first time that PAX8 facilitates proliferation and metastasis by repressing the cell autonomous tumor suppressor CCDC80 and inducing B7‐H3 expression.
Aya Saleh +12 more
wiley +1 more source
Block circulant graphs and the graphs of critical pairs of crowns
Electronic Journal of Graph Theory and Applications, 2019 In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns.
Rebecca E. Garcia +3 more
doaj +1 more source
Discrete Mathematics, 1991 The author gives an introductory survey of the theory of simplicial and related decompositions of graphs. It is based mainly on his recent book ``Graph decompositions. A study in infinite graph theory'' (1990; Zbl 0726.05001). Several open problems are presented.
openaire +1 more source