Results 61 to 70 of about 310,485 (285)
Clustering Algorithm Reveals Dopamine‐Motor Mismatch in Cognitively Preserved Parkinson's Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore the relationship between dopaminergic denervation and motor impairment in two de novo Parkinson's disease (PD) cohorts. Methods n = 249 PD patients from Parkinson's Progression Markers Initiative (PPMI) and n = 84 from an external clinical cohort.
Rachele Malito +14 more
wiley +1 more source
Computing the degree of some matchings in a graph
The American Journal of CombinatoricsLet \(G\) be a connected graph. A matching \(M\) in \(G\) is a set of edges of \(G\) without two of them adjacent (having a common vertex). The graph whose vertices are the matchings in \(G\) and two matchings \(M\) and \(N\) are adjacent if and only if
Rosário Fernandes
doaj +1 more source
A straightforward edge centrality concept derived from generalizing degree and strength
Scientific Reports, 2022 Vertex degree—the number of edges that are incident to a vertex—is a fundamental concept in network theory. It is the historically first and conceptually simplest centrality concept to rate the importance of a vertex for a network’s structure and ...
Timo Bröhl, Klaus Lehnertz
doaj +1 more source
Multidimensional Profiling of MRI‐Negative Temporal Lobe Epilepsy Uncovers Distinct Phenotypes
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Although hippocampal sclerosis (TLE‐HS) represents the most frequent cause of temporal lobe epilepsy (TLE), up to 30% of patients show no lesion on visual MRI inspection (TLE‐MRIneg). These cases pose diagnostic and therapeutic challenges and are underrepresented in surgical series.
Alice Ballerini +28 more
wiley +1 more source
Degree resistance distance of unicyclic graphs [PDF]
Transactions on Combinatorics, 2012 Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance ...
Ivan Gutman, Linhua Feng, Guihai Yu
doaj
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
On the vertex degree polynomial of graphs
, 2023 A novel graph polynomial, termed as vertex degree polynomial, has been conceptualized, and its discriminating power has been investigated regarding its coefficients and the coefficients of its derivatives and their relations with the physical and chemical properties of molecules.
Ahmed, Hanan +2 more
openaire +1 more source
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
On Domination Topological Indices of Graphs
International Journal of Analysis and Applications, 2020 Topological indices and domination in graphs are the essential topics in the theory of graphs. A set of vertices D ⊆ V (G) is said to be a dominating set for G if any vertex v ∈ V − D is adjacent to some vertex u ∈ D.
A.M. Hanan Ahmed +2 more
doaj
A Geometric Fractal Growth Model for Scale Free Networks
, 2001 We introduce a deterministic model for scale-free networks, whose degree distribution follows a power-law with the exponent $\gamma$. At each time step, each vertex generates its offsprings, whose number is proportional to the degree of that vertex with ...
A. Broder +23 more
core +1 more source