Results 91 to 100 of about 655,680 (212)

Loss of POGLUT2/3‐mediated O‐glucosylation produces lung and aortic phenotypes reminiscent of fibrillin1 mutants

open access: yesDevelopmental Dynamics, EarlyView.
Abstract Background Fibrillins provide a scaffold for elastic fiber formation, which enables lung recoil and aortic compliance. Abnormal fibrillin microfibrils, as in Marfan syndrome, lead to enlarged alveoli, vascular stiffening, and aneurysms. Our earlier studies suggested that fibrillin function depends on O‐glucosylation of its epidermal growth ...
Sanjiv Neupane   +4 more
wiley   +1 more source

The Topological Connectivity of the Independence Complex of Circular-Arc Graphs

open access: yesUniversal Journal of Mathematics and Applications, 2019
Let us denoted the topological connectivity of a simplicial complex $C$ plus 2 by $\eta(C)$. Let $\psi$ be a function from class of graphs to the set of positive integers together with $\infty$. Suppose $\psi$ satisfies the following properties: \newline
Yousef Abd Algani
doaj   +1 more source

The Feasibility Test of Electric Propulsion Systems: Case Study for a Light and Fixed‐Wing Aircraft

open access: yesEnergy Science &Engineering, EarlyView.
ABSTRACT This study investigates the feasibility and performance of a fully electric propulsion system (EPS) integrated into a light fixed‐wing aircraft. The system consists of a 65 kW‐class electric motor, a high‐efficiency inverter, and dual lithium‐ion battery packs with a total capacity of 27 kWh—collectively engineered to fulfill both power ...
Byeong Gyu Gang
wiley   +1 more source

Dualizing chordal graphs

open access: yesDiscrete Mathematics, 2003
This paper studies dual-chordal graphs, that is, graphs that are dual to chordal graphs with regard to cycle/cutset duality. A characteristic of such graphs is that every cutset with at least four edges is accompanied by a certain kind of edge, a ``cut-chord.'' One result allows us to recognize dual-chordal graphs by simply looking at cubic graphs.
openaire   +2 more sources

On groups with chordal power graph, including a classification in the case of finite simple groups

open access: yes, 2022
We prove various properties on the structure of groups whose power graph is chordal. Nilpotent groups with this property have been classified by Manna, Cameron and Mehatari [The Electronic Journal of Combinatorics, 2021].
Kaja, Eda, Brachter, Jendrik
core  

Single‐Cell RNA Sequencing and Spatial Multiomics Unveil Microglia–Mural Interactions Underlying Notoginsenoside R1 Against Ischemic Stroke

open access: yesiMetaMed, EarlyView.
Integrated scRNA‐seq and spatial multiomics provide single‐cell and spatial insights into the neuroprotective effects of NGR1, a clinically validated bioactive compound from Panax notoginseng. NGR1 was associated with a shift in microglial transcriptional states away from ischemia‐associated pro‐inflammatory Adam8hi microglia and toward the protective ...
Qikun Zhao   +10 more
wiley   +1 more source

Chordally signed graphs

open access: yesDiscrete Applied Mathematics, 2002
A chordally signed graph is defined as a signed chordal graph (each edge is designated as being positive or negative and every induced cycle is a triangle) in which every cycle \(C\) containing an even number of negative edges (positive cycles) has a chord \(e\) such that \(C\cup\{e\}\) forms two positive cycles.
openaire   +1 more source

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]

open access: yes
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core  

On the correspondence between tree representations of chordal and dually chordal graphs [PDF]

open access: yes, 2019
Chordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively.
De Caria, Pablo Jesús   +1 more
core  

Intersecting longest paths in chordal graphs

open access: yes, 2023
We consider the size of the smallest set of vertices required to intersect every longest path in a chordal graph. Such sets are known as longest path transversals.
Michael Payne (9496058)   +1 more
core   +1 more source

Home - About - Disclaimer - Privacy