Results 131 to 140 of about 329,714 (296)
Signed graphs with strong (anti-)reciprocal eigenvalue property
Special MatricesA (signed) graph is said to exhibit the strong reciprocal (anti-reciprocal) eigenvalue property (SR) (resp., (-SR)) if for any eigenvalue λ\lambda , it has 1λ\frac{1}{\lambda } (resp.,−1λ-\frac{1}{\lambda }) as an eigenvalue as well, with the same ...
Belardo Francesco, Huntington Callum
doaj +1 more source
Transactions on Combinatorics, 2014 A signed graph (marked graph) is an ordered pair $S=(G,sigma)$ $(S=(G,mu))$, where $G=(V,E)$ is a graph called the underlying graph of $S$ and $sigma:Erightarrow{+,-}$ $(mu:Vrightarrow{+,-})$ is a function.
Kishori P. Narayankar
doaj
Purkinje Cell Loss in Essential Tremor: Collective Data From 215 Brains Over a 21‐Year Period
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Essential tremor is a highly prevalent movement disorder. Pathological changes observed in essential tremor cerebella center around Purkinje cells and neighboring neuronal populations. Postmortem studies have variably, but not always, shown reduced Purkinje cell counts in essential tremor compared to controls.
Chloë A. Kerridge +4 more
wiley +1 more source
Graceful signed graphs: II. The case of signed cycles with connected negative sections [PDF]
, 2005 Mukti Acharya, Tarkeshwar Singh
openalex +1 more source
Expanding Hereditary Spastic Paraplegias Limits: Biallelic SPAST Variants in Cerebral Palsy Mimics
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Hereditary spastic paraplegias (HSP) are rare neurodegenerative disorders marked by spasticity and lower limb weakness. The most common type, SPG4, is usually autosomal dominant and caused by SPAST gene variants, typically presenting as pure HSP.
Gregorio A. Nolasco +18 more
wiley +1 more source
Signed analogs of bipartite graphs
Discrete Mathematics, 1998 Let \(\Sigma= (\Gamma,\sigma)\) be a finite signed graph (a graph with signed edges), where \(\Gamma= (V,E)\) is the underlying graph and \(\sigma: E\to\{+,-\}\) the sign labelling. Loops and multiple edges are allowed. The author proves, among other results, three equivalent statements and three equivalent properties of such \(\Sigma\) (Theorem 2 ...
openaire +2 more sources
Exosome Proteomics of SOD1D90A Mutation Suggest Early Disease Mechanisms, and FN1 as a Biomarker
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Amyotrophic lateral sclerosis (ALS) is a neuromuscular disease. Super oxide dismutase 1 (SOD1) gene mutations cause ALS, and the D90A mutation is associated with primarily upper motor neuron (UMN) loss. Objective Our goal is to reveal the early cellular events in ALS pathology and identify potential pharmacokinetic biomarkers, using well ...
Mukesh Gautam +6 more
wiley +1 more source
The Relationship Between Inflammation and Central Nervous System in Multiple Sclerosis
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Aim Multiple sclerosis is an autoimmune demyelination disease that is seen especially in the young population and has a progressive course, causing motor, sensory, and cognitive deficits. In the literature, the pathogenesis of MS disease and the interconnection between the immune and central nervous system in the disease have not been fully ...
Gamze Ansen +5 more
wiley +1 more source
The nullity of the net Laplacian matrix of a signed graph
The American Journal of CombinatoricsThe net Laplacian matrix of a signed graph \(\Gamma = (G, \sigma)\), where \(G = (V(G),E(G))\) is an unsigned graph (referred to as the underlying graph) and \(\sigma: E(G) \rightarrow \{-1, +1\}\) is the sign function, is defined as \(L^{\pm}(\Gamma) =
Zhuang Xiong
doaj +1 more source