Results 101 to 110 of about 177,806 (308)
ABSTRACT Background and Objectives Multiple sclerosis (MS) exhibits racially disparate rates of disease progression. Black people with MS (B‐PwMS) experience a more severe disease course than non‐Hispanic White people with MS (NHW‐PwMS). Here we investigated structural and functional connectivity as well as structure–function decoupling in the ...
Emilio Cipriano +11 more
wiley +1 more source
The Distance Matrices of Some Graphs Related to Wheel Graphs
Let D denote the distance matrix of a connected graph G. The inertia of D is the triple of integers (n+(D), n0(D), n-(D)), where n+(D), n0(D), and n-(D) denote the number of positive, 0, and negative eigenvalues of D, respectively.
Xiaoling Zhang, Chengyuan Song
doaj +1 more source
A Depolarizing Leak in Sodium Bicarbonate Cotransporter NBCe1 Causes Brain Edema
ABSTRACT Objectives SLC4A4 encodes electrogenic sodium bicarbonate cotransporter NBCe1, prominently expressed in kidney and brain. Recessive loss‐of‐function variants in SLC4A4 cause proximal renal tubular acidosis, no brain edema. In the brain, NBCe1 is expressed by astrocytes, where it regulates pH and mediates astrocyte volume changes.
Quinty Bisseling +16 more
wiley +1 more source
Distance independence in graphs
For a set D of positive integers, we define a vertex set SV (G) to be D-independent if u,v 2 S implies the distance d(u,v) 㘲 D. The D-independence numberD(G) is the maximum cardinality of a D-independent set. In particular, the independence number (G) = {1}(G).
J. Louis Sewell, Peter J. Slater
openaire +1 more source
ABSTRACT Objective Considerable efforts have been dedicated to developing effective treatments for post‐stroke executive impairment (PSEI), among which repetitive transcranial magnetic stimulation (rTMS) has shown great potential. This study aimed to investigate the therapeutic effects of high‐frequency rTMS on working memory (WM) and response ...
Mengting Lao +6 more
wiley +1 more source
Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs
For a set D⊂ Z n, the distance graph P n (D) has Z n as its vertex set and the edges are between vertices i and j with |i-j|∈D. The circulant graph C n (D) is defined analogously by considering operations modulo n.
Hamamache Kheddouci, Olivier Togni
doaj
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
Makhnev and Nirova have found intersection arrays of distance-regular graphs with no more than \(4096\) vertices, in which \(\lambda=2\) and \(\mu=1\). They proposed the program of investigation of distance-regular graphs with \(\lambda=2\) and \(\mu=1\)
Konstantin S. Efimov +1 more
doaj +1 more source
An Odd Characterization of the Generalized Odd Graphs
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graphs;generalized odd graphs;odd-girth;spectra of graphs;spectral excess theorem;spectral ...
Dam, E.R. van, Haemers, W.H.
core +2 more sources
Graphs of integral distance and their properties [PDF]
Philosophiae Doctor - PhDUnderstanding the geometries of points in space has been attractive to mathematicians for ages. As a model, twelve years ago, Kurz and Meyer [32] considered point sets in the m-dimensional a ne space Fmq over a nite eld Fq ...
Habineza, Olivier
core
RNA Sequencing Resolves Cryptic Pathogenic Variants in Mitochondrial Disease
ABSTRACT Objective Mitochondrial diseases are the most common inherited metabolic disorders, characterized by pronounced clinical and genetic heterogeneity that complicates molecular diagnosis. Although DNA‐based sequencing approaches have become standard in genetic testing, up to half of patients remain without a definitive diagnosis.
Zhimei Liu +21 more
wiley +1 more source

