Results 101 to 110 of about 286,497 (273)
Some New Cyclotomic Strongly Regular Graphs [PDF]
Given a field \(F\) and a subset \(D\) of \(F^*\) such that \(D= -D\), one can define a graph \(\Gamma\) with vertex set \(F\) by letting \(x\sim y\) whenever \(y- x\in D\). Several authors have studied the problem of finding sets \(D\) such that the graph \(\Gamma\) is strongly regular and many examples are known.
openaire +2 more sources
In a murine model of myocardial ischemia and reperfusion (MI/R), the CD36 azapeptide ligand MPE‐298 reduces cardiac injury and transiently lowers left ventricular long‐chain fatty acids (LCFAs) accumulation 3 h after reperfusion, accompanied by a decrease of oxidative stress and inflammation‐associated genes' expression in the heart and adipose tissue.
Jade Gauvin +12 more
wiley +1 more source
q-analogs of strongly regular graphs
We introduce the notion of q-analogs of strongly regular graphs and give several examples of such structures. We prove a necessary condition on the parameters, show the connection to designs over finite fields, and present a classification.
Michael Braun +4 more
openaire +3 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
ABSTRACT Objective To evaluate the efficacy and safety of ofatumumab in patients with myelin oligodendrocyte glycoprotein antibody–associated disease (MOGAD), and compare it with rituximab. Methods We conducted a single–center, observational study including 22 MOGAD patients treated with ofatumumab and 21 treated with rituximab.
Yuxin Fan +5 more
wiley +1 more source
Classifying Sets of Type (4,n) in PG(3,q)
In the present work, we classify sets of type (4,n) in PG(3,q). We prove that PG(3,q), apart from the planes of PG(3,3), contains only sets of type (4,n) with standard parameters. Thus, somewhat surprisingly, we conclude that there are no sets of type (4,
Stefano Innamorati
doaj +1 more source
Strongly Regular Fusions of Tensor Products of Strongly Regular Graphs
Let \(G\) and \(H\) be strongly regular graphs with (0, 1)-adjacency matrices \(A_ 0= I\), \(A_ 1\), \(A_ 2= J-I- A_ 1\) and \(B_ 0= I\), \(B_ 1,\) \(B_ 2= J- I- B_ 1\) respectively. The tensor product \(G\otimes H\) is defined to be the nine class association scheme with adjacency matrices \(A_ i\otimes B_ j\). By combining (fusing) some of these nine
openaire +2 more sources
Objective We developed a novel electronic health record sidecar application to visualize key rheumatoid arthritis (RA) outcomes, including disease activity, physical function, and pain, via a patient‐facing graphical interface designed for use during outpatient visits (“RA PRO dashboard”).
Gabriela Schmajuk +16 more
wiley +1 more source
Objective Knee osteoarthritis (OA) commonly affects individuals with type 2 diabetes (T2DM) and is associated with increased risk of diabetes‐related complications. To better understand potential mechanisms, we examined the association between symptomatic knee OA and glycemic control in individuals with T2DM.
Lauren K. King +10 more
wiley +1 more source
The Connectivity of Strongly Regular Graphs
Es wird bewiesen, daß in einem streng regulären Graphen jede kleinste trennende Eckenmenge aus den Nachbarn einer Ecke bestehen muß.
Brouwer, A.E., Mesner, D.M.
openaire +3 more sources

