Results 31 to 40 of about 805,669 (72)
Quantifying Uncertainty in Brain Network Measures using Bayesian Connectomics
The wiring diagram of the human brain can be described in terms of graph measures that characterize structural regularities. These measures require an estimate of whole-brain structural connectivity for which one may resort to deterministic or ...
Ronald Johannes Janssen+4 more
doaj +1 more source
Interval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem
The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. The uncertainty existing in the real world problems makes it difficult to determine the arc lengths exactly.
Arindam Dey, Anita Pal, Tandra Pal
doaj +1 more source
The niche graphs of interval orders [PDF]
The niche graph of a digraph $D$ is the (simple undirected) graph which has the same vertex set as $D$ and has an edge between two distinct vertices $x$ and $y$ if and only if $N^+_D(x) \cap N^+_D(y) \neq \emptyset$ or $N^-_D(x) \cap N^-_D(y) \neq \emptyset$, where $N^+_D(x)$ (resp. $N^-_D(x)$) is the set of out-neighbors (resp. in-neighbors) of $x$ in
arxiv +1 more source
Time estimation and beta segregation: An EEG study and graph theoretical approach. [PDF]
Elucidation of the neural correlates of time perception constitutes an important research topic in cognitive neuroscience. The focus to date has been on durations in the millisecond to seconds range, but here we used electroencephalography (EEG) to ...
Amir Hossein Ghaderi+5 more
doaj +1 more source
Equivalence of the filament and overlap graphs of subtrees of limited trees [PDF]
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs. In this paper, we show the equivalence of many more classes of subtree overlap and subtree filament graphs, and equate ...
arxiv +1 more source
In fear conditioning with time intervals between the conditioned (CS) and unconditioned (US) stimuli, a neural representation of the CS must be maintained over time to be associated with the later US.
Thays Brenner Santos+3 more
doaj +1 more source
Theory and Application of Interval-Valued Neutrosophic Line Graphs
Neutrosophic graphs are used to model inconsistent information and imprecise data about any real-life problem. It is regarded as a generalization of intuitionistic fuzzy graphs.
Keneni Abera Tola+2 more
doaj +1 more source
Sturm-Hurwitz Theorem for quantum graphs [PDF]
We prove upper and lower bounds for the number of zeroes of linear combinations of Schr\"odinger eigenfunctions on metric (quantum) graphs. These bounds are distinct from both the interval and manifolds. We complement these bounds by giving non-trivial examples for the lower bound as well as sharp examples for the upper bound.
arxiv
Spectral analysis of the matrix Sturm–Liouville operator
The self-adjoint matrix Sturm–Liouville operator on a finite interval with a boundary condition in general form is studied. We obtain asymptotic formulas for the eigenvalues and the weight matrices of the considered operator.
Natalia P. Bondarenko
doaj +1 more source
This paper considers the leader-following consensus tracking problem of fractional-order multi-agent systems (FOMASs) that contain communication time delays.
Shuaishuai Lv+5 more
doaj +1 more source