Results 71 to 80 of about 119,419 (266)

Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma

open access: yesMolecular Oncology, EarlyView.
The causes of central nervous system (CNS) hemangioblastoma in Von Hippel–Lindau (vHL) disease are unclear. We used Whole Exome Sequencing (WES) on familial hemangioblastoma to investigate events that underlie tumor development. Our findings suggest that VHL loss creates a permissive environment for tumor formation, while additional alterations ...
Maja Dembic   +5 more
wiley   +1 more source

On clique graphs and clique regular graphs

open access: yesDiscrete Mathematics
If $Γ$ is a graph for which every edge is in exactly one clique of order $ω$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $Γ$. We discover many general results and classifications related to these clique graph that will be useful to researchers studying these objects. In particular,
Robert R. Petro, Connor M. Phillips
openaire   +2 more sources

Dual PI3K/AKT and CDK4/6 inhibition reveals selective sensitivity in an SHH medulloblastoma stem cell model

open access: yesMolecular Oncology, EarlyView.
Targeted therapy was evaluated in SHH medulloblastoma using neuroepithelial stem cell (NES) and tumor‐derived NES‐like (tNES) models in 2D monolayers and 3D spheroids. PI3K, AKT, and CDK4/6 inhibitors had minimal effects in NES but markedly reduced viability and growth and induced apoptosis in tNES cells, revealing distinct therapeutic vulnerabilities.
Monika Lukoseviciute   +4 more
wiley   +1 more source

Edge-regular graphs with regular cliques [PDF]

open access: yesEuropean Journal of Combinatorics, 2018
We exhibit infinitely many examples of edge-regular graphs that have regular cliques and that are not strongly regular. This answers a question of Neumaier from 1981.
Gary R. W. Greaves, Jack H. Koolen
openaire   +3 more sources

Establishment of a humanized patient‐derived xenograft mouse model of high‐grade serous ovarian cancer for preclinical evaluation of combination immunotherapy

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

Distance regular graphs of diameter 3 and strongly regular graphs

open access: yesDiscrete Mathematics, 1984
In a paper by \textit{N. L. Biggs} [Ann. Discrete Math. 15, 69-80 (1982; Zbl 0506.05057)], two parameter sets for distance regular graphs that are antipodal covers of a complete graph were mentioned for which the existence of a corresponding graph was unknown.
openaire   +3 more sources

Deciphering transcriptional plasticity in pancreatic ductal adenocarcinoma reveals alterations in sensory neuron innervation

open access: yesMolecular Oncology, EarlyView.
Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova   +14 more
wiley   +1 more source

Construction of Cospectral Integral Regular Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
Graphs G and H are called cospectral if they have the same characteristic polynomial. If eigenvalues are integral, then corresponding graphs are called integral graph.
Bapat Ravindra B., Karimi Masoud
doaj   +1 more source

On The Total Irregularity Strength of Regular Graphs

open access: yesJournal of Mathematical and Fundamental Sciences, 2015
Let 𝐺 = (𝑉, 𝐸) be a graph. A total labeling 𝑓: 𝑉 ∪ 𝐸 → {1, 2, ⋯ , 𝑘} is called a totally irregular total 𝑘-labeling of 𝐺 if every two distinct vertices 𝑥 and 𝑦 in 𝑉 satisfy 𝑤𝑓(𝑥) ≠ 𝑤𝑓(𝑦) and every two distinct edges 𝑥1𝑥2 and 𝑦1𝑦2 in 𝐸 satisfy 𝑤𝑓(𝑥1𝑥2 ...
Rismawati Ramdani   +2 more
doaj   +1 more source

Matchings in regular graphs

open access: yesDiscrete Mathematics, 1981
AbstractWe consider k-regular graphs with specified edge connectivity and show how some classical theorems and some new results concerning the existence of matchings in such graphs can be proved by using the polyhedral characterization of Edmonds.
Denis Naddef, William R. Pulleyblank
openaire   +1 more source

Home - About - Disclaimer - Privacy