Results 81 to 90 of about 542,793 (319)
A Novel Description on Vague Graph with Application in Transportation Systems
Journal of Mathematics, 2021 Fuzzy graph (FG) models embrace the ubiquity of existing in natural and man-made structures, specifically dynamic processes in physical, biological, and social systems.
Zheng Kou, Saeed Kosari, Maryam Akhoundi
doaj +1 more source
Regular handicap graphs of order n ≡ 4 (mod 8)
Electronic Journal of Graph Theory and Applications, 2022 A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f : V → {1, 2, …, n} with the property that f(xi)=i, the weight w(xi) is the sum of labels of all neighbors of xi, and the sequence of the weights w(x1),w(x2),…,w(
Dalibor Froncek, Aaron Shepanik
doaj +1 more source
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
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
Distance-regular graph with large a1 or c2 [PDF]
, 2010 In this paper, we study distance-regular graphs $\Gamma$ that have a pair of distinct vertices, say x and y, such that the number of common neighbors of x and y is about half the valency of $\Gamma$.
Koolen, Jack H., Park, Jongyook
core
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
A duality between pairs of split decompositions for a Q-polynomial distance-regular graph [PDF]
Discrete Mathematics, 2007 Let @C denote a Q-polynomial distance-regular graph with diameter D>=3 and standard module V. Recently, Ito and Terwilliger introduced four direct sum decompositions of V; we call these the (@m,@n)-split decompositions of V, where @m,@[email protected]?{@
Joohyung Kim
semanticscholar +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
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
A Conjecture of Biggs Concerning the Resistance of a Distance-Regular Graph [PDF]
Electronic Journal of Combinatorics, 2010 Biggs conjectured that the resistance between any two points on a distance-regular graph of valency greater than 2 is bounded by twice the resistance between adjacent points.
Greg Markowsky, J. Koolen
semanticscholar +1 more source