Results 61 to 70 of about 2,427,282 (299)
-shaped point set embeddings of high-degree plane graphs
A point set embedding of a given plane graph on a given point set on a plane is a drawing of where each vertex is drawn on a point in . An orthogonal point set embedding of a plane graph is a point set embedding of such that each edge is drawn as a ...
Shaheena Sultana, Md. Saidur Rahman
doaj +1 more source
Decomposing plane cubic graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kenta Ozeki, Dong Ye
openaire +2 more sources
Tau acetylation at K331 has limited impact on tau pathology in vivo
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs [PDF]
We consider the following question: How many edgedisjoint plane spanning trees are contained in a complete geometric graph GKn on any set S of n points in general position in the plane?
O. Aichholzer +7 more
semanticscholar +1 more source
A comprehensive genomic and proteomic analysis of cervical cancer revealed STK11 and STX3 as a potential biomarkers of chemoradiation resistance. Our study demonstrated EGFR as a therapeutic target, paving the way for precision strategies to overcome treatment failure and the DNA repair pathway as a critical mechanism of resistance.
Janani Sambath +13 more
wiley +1 more source
Models of Klein Surface Obstruction Graphs
The task of researching the structure of graphs of given connectivity, which are obstructions for a given surface of non-oriented kind, and building their models, from which obstruction graphs are formed by removing or compressing a set of edges, is ...
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj +1 more source
On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs
The circumference of a graph G is the length of a longest cycle in G, denoted by cirG. For any even number n, let cn = min {cirG|G is a 3-connected cubic triangle-free plane graph with n vertices}. In this paper, we show that an upper bound of cn is n+1−
Adthasit Sinna +2 more
doaj +1 more source
Some Operations on Complex Fuzzy Graphs
In this paper we discussed about some types of complex fuzzy graphs which is the extension of fuzzy graph. As the membership value of elements of fuzzy graph is in between 0 and 1.
Azhagendran N, Mohamed Ismayil A
doaj +1 more source
Modeling hepatic fibrosis in TP53 knockout iPSC‐derived human liver organoids
This study developed iPSC‐derived human liver organoids with TP53 gene knockout to model human liver fibrosis. These organoids showed elevated myofibroblast activation, early disease markers, and advanced fibrotic hallmarks. The use of profibrotic differentiation medium further amplified the fibrotic signature seen in the organoids.
Mustafa Karabicici +8 more
wiley +1 more source
Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs [PDF]
We study Markov chains for $\alpha$-orientations of plane graphs, these are orientations where the outdegree of each vertex is prescribed by the value of a given function $\alpha$.
Stefan Felsner, Daniel Heldt
doaj +1 more source

