OBJECTIVES Bipolar disorder (BD) is associated with elevated reward sensitivity and persistent positive affect, yet the neural mechanisms underlying these patterns are not well understood. In the present study, we examined putative disruptions in communication within a well-known cortico-limbic reward circuit during reward processing as a potential contributing mechanism to these symptoms. ME...

Intrinsic functional connectivity detected by functional MRI (fMRI) provides a useful but indirect approach to study the organization of human brain systems. An unresolved question is whether functional connectivity measured by resting-state fMRI reflects anatomical connections. In this study, we used the well-characterized anatomy of cerebrocerebellar circuits to directly test whether intrinsi...

Only recently has the complex anatomo-functional system underlying numerical cognition become accessible to evaluation in the living brain. We identified 27 studies investigating brain connectivity in numerical cognition. Despite considerable heterogeneity regarding methodological approaches, populations investigated, and assessment procedures implemented, the results provided largely convergin...

For a 2-connected matroid M , Cunningham and Edmonds gave a tree decomposition that displays all of its 2-separations. When M is 3-connected, two 3-separations are equivalent if one can be obtained from the other by passing through a sequence of 3-separations each of which is obtained from its predecessor by moving a single element from one side of the 3-separation to the other. Oxley, Semple, ...

Let G be a 4-connected graph. For an edge e of G, we do the following operations on G: first, delete the edge e from G, resulting the graph G − e; second, for all the vertices x of degree 3 in G− e, delete x from G− e and then completely connect the 3 neighbors of x by a triangle. If multiple edges occur, we use single edges to replace them. The final resultant graph is denoted by G a e. If G a...

the eccentricity connectivity index of a molecular graph g is defined as (g) = av(g)deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to othervertices of g and deg(a) is degree of vertex a. here, we compute this topological index forsome infinite classes of dendrimer graphs.

in this paper we present explicit formulas for the eccentric connectivity index of three classesof chain hexagonal cacti. further, it is shown that the extremal chain hexagonal cacti withrespect to the eccentric connectivity index belong to one of the considered types. some openproblems and possible directions of further research are mentioned in the concluding section.

in this paper, we calculate the eccentric connectivity index and the eccentricity sequence of two infinite classes of fullerenes with 50 + 10k and 60 + 12k (k in n) carbon atoms.

let r be a fnite commutative ring and n(r) be the set of non unit elements of r. the non unit graph of r, denoted by gamma(r), is the graph obtained by setting all the elements of n(r) to be the vertices and defning distinct vertices x and y to be adjacent if and only if x - yin n(r). in this paper, the basic properties of gamma(r) are investigated and some characterization results regarding co...

The authors previously published an iterative process to generate a class of projectiveplanarK3,4-free graphs called ‘patch graphs’. They also showed that any simple, almost 4-connected, nonplanar, and projective-planar graph that is K3,4-free is a subgraph of a patch graph. In this paper, we describe a simpler and more natural class of cubic K3,4free projective-planar graphs which we call Möbi...