Results 61 to 70 of about 42,350 (268)
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
Parallelogram-Free Distance-Regular Graphs
Journal of Combinatorial Theory, Series B, 1997 This paper deals with distance-regular graphs. It is shown that a distance-regular graph with certain properties has classical parameters \((d,b,\alpha,\beta)\) with ...
Yuh-jeng Liang, Chih-Wen Weng
openaire +3 more sources
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
Nonexistence of a Class of Distance-Regular Graphs
The Electronic Journal of Combinatorics, 2015 Let $\Gamma$ denote a distance-regular graph with diameter $D \geq 3$ and intersection numbers $a_1=0, a_2 \neq 0$, and $c_2=1$. We show a connection between the $d$-bounded property and the nonexistence of parallelograms of any length up to $d+1$. Assume further that $\Gamma$ is with classical parameters $(D, b, \alpha, \beta)$, Pan and Weng (2009 ...
Yu-Pei Huang +2 more
openaire +3 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
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +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
Shortest Paths in Distance-regular Graphs
European Journal of Combinatorics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enrique Bendito +2 more
openaire +2 more sources
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
FEBS Open Bio, EarlyView.MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +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