An edge colored graph G is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this work we study the rainbow connectivity of binomial random graphs at the connectivity threshold p = log n+ω ...

An edge colored graph G is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this work we study the rainbow connectivity of binomial random graphs at the connectivity threshold p = logn+ω n...

Rainbow trout, Oncorhynchus mykiss, vitellogenin (Vtg) was purified from plasma of E2-treated male by direct anion exchange chromatography and some of its biochemical characteristics were studied. Our results demonstrated that, under SDS-PAGE conditions, rainbow trout Vtg was composed of two molecular forms of 390 and 176 kDa representing, respectively, the dimeric form and the monomeric from o...

The Present study was aimed to evaluate the therapeutic effectiveness of 1, 5-benzothiazapine derivative in central nervous diseases. 1,5Benzothiazipines are the seven–membered heterocyclic ring systems which are reported for their behavioral activities. In the current research, we have investigated the effect of 1,5-benzothiazine derivative for its anti-anxiety, antidepressant and anti-catalep...

We obtain new results on 2-rainbow domination number of generalized Petersen graphs P(5k,k). In some cases (for infinite families), exact values are established, and in all other lower upper bounds given. particular, it is shown that, for k>3, γr2(P(5k,k))=4k k≡2,8mod10, γr2(P(5k,k))=4k+1 k≡5,9mod10, 4k+1≤γr2(P(5k,k))≤4k+2 k≡1,6,7mod10, 4k+1≤γr2(P(5k,k))≤4k+3 k≡0,3,4mod10.

In this note, we provide a sharp upper bound on the rainbow connection number of tournaments of diameter 2. For a tournament T of diameter 2, we show 2 ≤ − →rc(T ) ≤ 3. Furthermore, we provide a general upper bound on the rainbow k-connection number of tournaments as a simple example of the probabilistic method. Finally, we show that an edge-colored tournament of kth diameter 2 has rainbow k-co...

BACKGROUND Paranoia is one of the commonest symptoms of psychosis but has rarely been studied in a population at risk of developing psychosis. Based on existing theoretical models, including the proposed distinction between ‘poor me’ and ‘bad me’ paranoia, we aimed to test specific predictions about associations between negative cognition, metacognitive beliefs and negative emotions and paranoi...