Results 71 to 80 of about 285,444 (268)
Edge δ− Graceful Labeling for Some Cyclic-Related Graphs
In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the induced mapping ...
Mohamed R. Zeen El Deen
doaj +1 more source
Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma
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
The Ceresa period from tropical homology
The Jacobian of a very general complex algebraic curve of genus at least 3 contains an algebraic cycle called the Ceresa cycle that is homologically trivial but algebraically nontrivial.
Caelan Ritter
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
An oriented 3-graph consists of a family of triples (3-sets), each of which is given one of its two possible cyclic orientations. A cycle in an oriented 3-graph is a positive sum of some of the triples that gives weight zero to each 2-set. Our aim in this paper is to consider the following question: how large can the girth of an oriented 3-graph (on $n$
Imre Leader, Ta Sheng Tan
openaire +3 more sources
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
ALPHA LABELINGS OF DISJOINT UNION OF HAIRY CYCLES
In this paper, we prove the following results: 1) the disjoint union of \(n\geq 2\) isomorphic copies of the graph which is obtained by adding a pendent edge to each vertices of the cycle of order 4 admits \(\alpha\)-valuation; 2) the disjoint union of ...
G. Rajasekaran, L. Uma
doaj +1 more source
On separating cycles in graphs
AbstractA cycle S in a connected graph G is a separating cycle if the deletion of S from G results in a disconnected graph. The paper contains a complete description of the graphs which have no separating cycles.
openaire +2 more sources
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
Karakteristik Graf Dengan Sisi Bilangan Fibonacci
Let be a finite subset of Fibonacci numbers set. In this research, we construct a graph where the set of vertices contains integer numbers such that for every , there exist some edge in that satisfies the condition . By applying some properties
Darmajid, Dwi Mifta Mahanani
doaj +1 more source

