BACKGROUND The influence of psychoactive drugs on the central nervous system has been investigated with positron emission tomography and task-related functional magnetic resonance imaging. However, it is not known how these drugs affect the intrinsic large-scale interactions of the brain (resting-state functional magnetic resonance imaging connectivity). In this study, the effect of low-dose S(...

Automatic mimicry is based on the tight linkage between motor and perception action representations in which internal models play a key role. Based on the anatomical connection, we hypothesized that the direct effective connectivity from the posterior superior temporal sulcus (pSTS) to the ventral premotor area (PMv) formed an inverse internal model, converting visual representation into a moto...

Real-world networks are prone to breakdowns. Typically in the underlying graph G, besides the insertion or deletion of edges, the set of active vertices changes overtime. A vertex might work actively, or it might fail, and gets isolated temporarily. The active vertices are grouped as a set S. S is subjected to updates, i.e., a failed vertex restarts, or an active vertex fails, and gets deleted ...

Let R be a commutative ring with identity and M an R-module. The Scalar-Product Graph of M is defined as the graph GR(M) with the vertex set M and two distinct vertices x and y are adjacent if and only if there exist r or s belong to R such that x = ry or y = sx. In this paper , we discuss connectivity and planarity of these graphs and computing diameter and girth of GR(M). Also we show some of...

One of the most basic problems in computer science is that of deciding connectivity in graphs, i.e. S-T Connectivity: Given a directed graph G and two vertices s and t, is there a path from s to t in G? This problem can of course be solved in linear time using breadth-first or depth-first search. However , these algorithms also require linear space. It turns out that S-T Connectivity can in fac...

in this paper, a new molecular-structure descriptor, the general sum–connectivity co–index  is considered, which generalizes the first zagreb co–index and the general sum–connectivity index of graph theory. we mainly explore the lower and upper bounds in termsof the order and size for this new invariant. additionally, the nordhaus–gaddum–type resultis also represented.

Recent studies have shown that relative permeability can be modeled as a state function which is independent of flow direction and dependent upon phase saturation (S), connectivity (X), fluid–fluid interfacial area (A). This study evaluates the impact each three parameters (S, X, A) in estimation permeability. The importance four separate quadrants S-X-A space was evaluated using machine learni...

For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components and a minimum vertex separator is a vertex separator of least cardinality. The vertex connectivity refers to the size of a minimum vertex separator. For a connected graph G with vertex connectivity k (k ≥ 1), the connectivity augmentation refers to a set S of edges whose augmentation toG...