Results 61 to 70 of about 322,612 (279)
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
On almost distance-regular graphs. [PDF]
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graph;walk-regular graph;eigenvalues;predistance ...
Dalfo, C. +4 more
core +4 more sources
Simple random walk on distance-regular graphs [PDF]
, 2013 A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong bounds for ...
Markowsky, Greg
core
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
On the metric dimension of imprimitive distance-regular graphs
, 2016 A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$.
Bailey, Robert F.
core +1 more source
Functional Connectivity Linked to Cognitive Recovery After Minor Stroke
Annals of Clinical and Translational Neurology, EarlyView.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
Graphs, friends and acquaintances
Electronic Journal of Graph Theory and Applications, 2018 A graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Many of the first results concerning graphs made reference to relationships between groups of people.
Cristina Dalfo, Miquel Àngel Fiol
doaj +1 more source
On the Edge Resolvability of Double Generalized Petersen Graphs
Journal of Mathematics, 2022 For a connected graph G=VG,EG, let v∈VG be a vertex and e=uw ∈EG be an edge. The distance between the vertex v and the edge e is given by dGe,v=mindGu,v,dGw,v. A vertex w∈VG distinguishes two edges e1,e2∈EG if dGw,e1≠dGw,e2.
Tanveer Iqbal +4 more
doaj +1 more source
Graphs cospectral with distance-regular graphs [PDF]
Linear and Multilinear Algebra, 1995 We determine all graphs with the spectrum of a distance-regular graph with at most 30 vertices (except possibly for the Taylor graph on 28 vertices)
Haemers, W.H., Spence, E.
openaire +4 more sources
The Erd\H{o}s-Ko-Rado theorem for twisted Grassmann graphs
, 2011 We present a "modern" approach to the Erd\H{o}s-Ko-Rado theorem for Q-polynomial distance-regular graphs and apply it to the twisted Grassmann graphs discovered in 2005 by van Dam and Koolen.Comment: 5 ...
A. E. Brouwer +24 more
core +1 more source