Results 31 to 40 of about 494 (225)
Maximum nullity and zero forcing number on cubic graphs
Let $G$ be a graph. The maximum nullity of $G$, denoted by $M(G)$, is defined to be the largest possible nullity over all real symmetric matrices $A$ whose $a_{ij}\neq 0$ for $i\neq j$, whenever two vertices $u_i$ and $u_j$ of $G$ are adjacent. In this paper, we characterize all cubic graphs with zero forcing number $3$.
Akbari, Saieed +2 more
openaire +2 more sources
Matrix metalloproteinase‐9 (MMP9) drives ovarian cancer progression. Using MMP9‐null cells (M9‐KO) created from ovarian cancer cells, we found MMP9 loss did not block Epidermal Growth Factor (EGF)‐driven E‐cadherin dissolution or EMT but delayed and reduced EGF‐driven membrane protrusions. Transient MMP9 re‐expression drove membrane protrusion.
Claire Strauel +8 more
wiley +1 more source
Maximum Nullity and Forcing Number on Graphs with Maximum Degree at most Three
A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $F$ of colored vertices, with all remaining vertices being non-colored. At each time step, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to be colored.
Alishahi, Meysam +2 more
openaire +2 more sources
Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
AbstractTree‐width, and variants that restrict the allowable tree decompositions, play an important role in the study of graph algorithms and have application to computer science. The zero forcing number is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by a graph.
Barioli, Francesco +7 more
openaire +5 more sources
Visual Recovery Reflects Cortical MeCP2 Sensitivity in Rett Syndrome
ABSTRACT Objective Rett syndrome (RTT) is a devastating neurodevelopmental disorder with developmental regression affecting motor, sensory, and cognitive functions. Sensory disruptions contribute to the complex behavioral and cognitive difficulties and represent an important target for therapeutic interventions.
Alex Joseph Simon +12 more
wiley +1 more source
ABSTRACT Background Myasthenia gravis (MG) is a rare disorder characterized by fluctuating muscle weakness with potential life‐threatening crises. Timely interventions may be delayed by limited access to care and fragmented documentation. Our objective was to develop predictive algorithms for MG deterioration using multimodal telemedicine data ...
Maike Stein +7 more
wiley +1 more source
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
Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs [PDF]
∗Department of Mathematics, Statistics, and Computer Science, St. Olaf College, Northfield, MN 55057 (berliner@stolaf.edu), (coxn@stolaf.edu). Research of N. Cox supported by NSF DMS 0750986 †Department of Mathematics, Carleton College, Northfield, MN 55057 (brownc@carleton.edu). Research supported by NSF DMS 0750986.
Berliner, Adam +10 more
openaire +3 more sources
ABSTRACT Objective To investigate the value of constructing models based on habitat radiomics and pathomics for predicting the risk of progression in high‐grade gliomas. Methods This study conducted a retrospective analysis of preoperative magnetic resonance (MR) images and pathological sections from 72 patients diagnosed with high‐grade gliomas (52 ...
Yuchen Zhu +14 more
wiley +1 more source
Minimum rank, maximum nullity, and zero forcing number of simple digraphs
A simple digraph describes the off-diagonal zero-nonzero pattern of a family of (not necessarily symmetric) matrices. Minimum rank of a simple digraph is the minimum rank of this family of matrices; maximum nullity is defined analogously. The simple digraph zero forcing number is an upper bound for maximum nullity.
Berliner, Adam +5 more
openaire +3 more sources

