Results 61 to 70 of about 39,337 (267)
Distance-Locally Disconnected Graphs
Discussiones Mathematicae Graph Theory, 2013 For an integer k ≥ 1, we say that a (finite simple undirected) graph G is k-distance-locally disconnected, or simply k-locally disconnected if, for any x ∈ V (G), the set of vertices at distance at least 1 and at most k from x induces in G a disconnected
Miller Mirka +2 more
doaj +1 more source
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
Research on 7-distance set with DG(XD)=C11
Journal of Hebei University of Science and Technology, 2016 A planar point set X is called a k-distance set if there are exactly k distances between two distinct points in X. Let d(x,y) be the distance of any two distinct points x,y. Let diameter D=D(X) be the longest distance of X.
Qi WANG, Yue CONG, Feixing GAO
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
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
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
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
Advanced Engineering Materials, Volume 27, Issue 6, March 2025.ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
Three New Distance-regular Graphs
European Journal of Combinatorics, 1993 We describe three new diameter 4 distance-regular triple covers of strongly regular graphs. The first two such covers are distance- transitive, with intersection arrays \{416,315,64,1;1,32,315,416\} and \{56,45,16,1;1,8,45,56\}. The third has intersection array \{32,27,8,1;1,4,27,32\}, but is not distance-transitive.
openaire +2 more sources
On Subgraphs in Distance-Regular Graphs [PDF]
Journal of Algebraic Combinatorics, 1992 A graph is distance-regular when it is simple and for any two vertices at distance \(j\), the numbers of vertices adjacent to one and at distance \(j- 1\) (resp. \(j\) and \(j+1)\) of the other are constant (depending on \(j\) only). First some necessary conditions are derived for distance- regularity of the subgraph of the geodesics joining two ...
openaire +3 more sources