Results 71 to 80 of about 310,757 (283)
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Onasemnogene abeparvovec (OA) is an AAV9‐based gene therapy for spinal muscular atrophy type I (SMA I). Real‐world outcomes show increased response variability compared to clinical trials, and follow‐up data beyond 12–18 months are limited.
Marika Pane +43 more
wiley +1 more source
Molecules, 2019 The rhenadicarbaborane carbonyl nitrosyls (C2Bn−3Hn−1)Re(CO)2(NO), (n = 8 to 12), of interest in drug delivery agents based on the experimentally known C2B9H11Re(CO)2(NO) and related species, have been investigated by density functional ...
Amr A. A. Attia +3 more
doaj +1 more source
Matroidal Degree-Bounded Minimum Spanning Trees [PDF]
, 2011 We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints.
Zenklusen, Rico
core
Vertex degrees of planar graphs
Journal of Combinatorial Theory, Series B, 1979 AbstractLet G be a planar graph having n vertices with vertex degrees d1, d2,…,dn. It is shown that Σi=1ndi2 ≤ 2n2 + O(n). The main term in this upper bound is best possible.
openaire +1 more source
Arthritis Care &Research, EarlyView.Objective To explore whether higher body fat and lower lean mass are associated with greater pain and worse patient‐reported physical function in individuals with hip osteoarthritis (OA). A secondary aim was to examine whether pain and patient‐reported physical function differ according to four body composition profiles: high body fat, low lean mass ...
Alexandra Ryan +10 more
wiley +1 more source
On the Number of Spanning Trees of Graphs
The Scientific World Journal, 2014 We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices (n), the number of edges (m), maximum vertex degree (Δ1), minimum vertex degree (δ), first Zagreb index (M1), and Randić index (R-1).
Ş. Burcu Bozkurt, Durmuş Bozkurt
doaj +1 more source
Large rainbow matchings in large graphs [PDF]
, 2011 A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex $v$ is the number of different colors on edges incident to $v$. We show that if $n$ is large enough (namely, $n\geq
Kostochka, Alexandr +2 more
core +1 more source
Advanced Engineering Materials, EarlyView.The tribological behavior of 100Cr6 steel spheres textured via Vickers microindentation is evaluated under lubricated sliding by varying both dimple size and density. Fine and dense textures significantly reduce friction across all lubrication regimes, while large dimples increase it.
Farideh Davoodi +3 more
wiley +1 more source
ON THE DISTRIBUTION OF THE SECOND DEGREES OF CONFIGURATION GRAPHS VERTICES
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2019 The object is configuration graphs with N vertices, numbered from 1 to N, whosevertex degrees are independent identically distributed random variables.
Elena Khvorostyanskaya
doaj +1 more source
On Partitioning the Edges of 1-Plane Graphs
, 2016 A 1-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A 1-plane graph is optimal if it has maximum edge density.
Lenhart, William J. +2 more
core +1 more source