Results 61 to 70 of about 196,583,728 (297)
Association Between Motor Pathway Damage and Motor Deficit in Upper and Lower Limb in People With MS
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Corticospinal tract damage is common in people with MS, but the degree of clinical symptoms varies. We hypothesize that corticospinal tract lesions are more extensive and severe in people with MS with motor impairments in both upper and lower limbs.
Mathilde Liffran +13 more
wiley +1 more source
Vertex degree distribution of a random intersection graph. [PDF]
, 2008 Random intersection graphs audits vertex degree distributions are viewed. Its proved, vertex degree has Binomial distribution.
Buivydas, Eugenijus,
core
The (a,b)-Zagreb index of line graphs of subdivision graphs of some molecular structures
International Journal of Mathematics for Industry, 2020 A graph is a mathematical model used to predict the topology of a given system. In chemical graph theory, a graph is designed by considering atoms as vertices and edges as bonds between atoms of a particular molecule.
Prosanta Sarkar, Anita Pal, Nilanjan De
doaj +1 more source
Advanced Engineering Materials, EarlyView.Scandium (Sc)‐doped AlCoCrFeMo HEA coatings are fabricated via flame spraying with 0.1, 0.3, and 0.5 wt% Sc additions. Among these, the HEA‐Sc0.3 coating exhibits the highest corrosion resistance, indicated by a more positive corrosion potential and lower current density.
Pankaj Kumar +7 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
On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Assume that $n, \delta ,k$ are integers with $0 \leq k < \delta < n$. Given a graph $G=(V,E)$ with $|V|=n$. The symbol $G-F, F \subseteq V$, denotes the graph with $V(G-F)=V-F$, and $E(G-F)$ obtained by $E$ after deleting the edges with at least one ...
Shih-Yan Chen, Shin-Shin Kao, Hsun Su
doaj +1 more source
Advanced Engineering Materials, EarlyView.Binder‐free laser powder bed fusion of 8YSZ with a femtosecond laser is used to map process windows linking scan strategy, heat accumulation, and grain growth. Time‐resolved thermography and simulations reveal thermal regimes that enable continuous, vitrified, and fine‐grained 8YSZ surface layers without absorptive additives and demonstrate ...
Markus Kühn +5 more
wiley +1 more source
Graph Realizations: Maximum Degree in Vertex Neighborhoods [PDF]
, 2020 The classical problem of degree sequence realizability asks whether or not a given sequence of n positive integers is equal to the degree sequence of some n-vertex undirected simple graph. While the realizability problem of degree sequences has been well
Rawitz, Dror +3 more
core +1 more source
Vertex Degree Weighted Path Indices
Acta Chimica Slovenica, 2016 Vertex degree weighted path indices P(N)(a, b, ...), for example P(1)(a, b), P(2)(a, b, c), P(3)(a, b, c, d), and P(4)(a, b, c, d, e), are good topological indices for some of the physicochemical properties of octanes with |R|(max) up to 0.999. Mutually optimized combinations of them are even better, R (P(1)..P(4)) is in the worst tested case > 0.9 ...
openaire +5 more sources
On the degrees of a strongly vertex-magic graph
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Camino Balbuena +8 more
openaire +2 more sources