Results 81 to 90 of about 24,440 (246)
AbstractWe strengthen a theorem of W.T. Trotter relating α-imperfect graphs to Suslin trees and derive several new results for infinite graphs with no chordless 4-cycles. We show that for such graphs G, (1) if G is χ-perfect then G is α-perfect, and (2) ΘG is at most the first cardinal beyond αG. We also indicate how Martin's axiom can be used to prove
openaire +2 more sources
Functional Connectivity Linked to Cognitive Recovery After Minor Stroke
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri +7 more
wiley +1 more source
A Laplacian eigenbasis for threshold graphs
Let GG be a graph on nn vertices. In this article, we prove that an eigenbasis of the Laplacian matrix of a star graph of order nn is also an eigenbasis of GG if and only if GG is a threshold graph. As an application of this spectral characterization, we
Macharete Rafael R. +3 more
doaj +1 more source
The author gives an introductory survey of the theory of simplicial and related decompositions of graphs. It is based mainly on his recent book ``Graph decompositions. A study in infinite graph theory'' (1990; Zbl 0726.05001). Several open problems are presented.
openaire +1 more source
ABSTRACT Background Myasthenia gravis (MG) is an autoimmune disorder characterized by antibody‐mediated complement activation. Efgartigimod, a neonatal Fc receptor (FcRn) antagonist, is approved for treating generalized MG (gMG). However, its modulatory effects on upstream innate and adaptive immune cells remain largely unexplored.
Lei Jin +11 more
wiley +1 more source
On Independent Domination in Planar Cubic Graphs
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S.
Abrishami Gholamreza +2 more
doaj +1 more source
Real‐World Performance of CSF Kappa Free Light Chains in the 2024 McDonald Criteria
ABSTRACT Objective Kappa free light chains (KFLCs) in the cerebrospinal fluid (CSF) have a similar performance to CSF‐restricted oligoclonal bands (OCB) for multiple sclerosis (MS) diagnosis. To help with implementation, we set out to resolve several remaining uncertainties: (1) performance in a real‐world cohort and the 2024 McDonald criteria; (2 ...
Maya M. Leibowitz +11 more
wiley +1 more source
Reconstructing infinite graphs [PDF]
Bondy, J. A., Hemminger, R. L.
openaire +2 more sources
ABSTRACT Objective To delineate specific in vivo white matter pathology in neuronal intranuclear inclusion disease (NIID) using diffusion spectrum imaging (DSI) and define its clinical relevance. Methods DSI was performed on 42 NIID patients and 38 matched controls.
Kaiyan Jiang +10 more
wiley +1 more source
On the discrete spectrum of the Dirac operator on bent chain quantum graph
We study Dirac operators on an infinite quantum graph of a bent chain form which consists of identical rings connected at the touching points by δ-couplings with a parameter α ∈ ℝ.
Belov Michail, Popov Igor, Blinova Irina
doaj +1 more source

