Let G be an edge-colored copy of Kn, where each color appears on at most n/2 edges (the edgecoloring is not necessarily proper). A rainbow spanning tree is a spanning tree of G where each edge has a different color. Brualdi and Hollingsworth [4] conjectured that every properly edge-colored Kn (n ≥ 6 and even) using exactly n−1 colors has n/2 edge-disjoint rainbow spanning trees, and they proved...

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 connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow edgeconnected. We prove that if G has n vertices and minimum degree δ then rc(G) < 20n/δ. This solves open problems from [5] and...

The drought tolerance of canola cultivars viz., Shirale, Oscar, Con-II, Rainbow and 19H was investigated after exposure to drought stress at various growth stages in a pot experiment. Water stress was imposed at flowering and pod filling growth stages. Data of various physiological (leaf chlorophyll a & b, proline and protein contents) and agronomic attributes (number of pods/plant, seeds/pods,...

2,3,7,8-Tetrachlorodibenzo-p-dioxin (TCDD, dioxin) is a widespread environmental contaminant that causes multiple effects in vertebrates. TCDD elicits its toxicity through aryl hydrocarbon receptor (AhR)-mediated modulation of gene regulation, increasing intracellular free calcium, and inducing calcium-mediated apoptosis in cell culture. Two TCDD-responsive cDNAs, which encode putative calcium-...

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...

Let G be an edge-colored graph. A rainbow (heterochromatic, or multicolored) path of G is such a path in which no two edges have the same color. Let the color degree of a vertex v to be the number of different colors that are used on edges incident to v, and denote it by dc(v). In a previous paper, we showed that if dc(v) ≥ k (color degree condition) for every vertex v of G, then G has a rainbo...

We describe the finding of a novel viral haemorrhagic septicaemia virus (VHSV) Genotype III strain that caused disease of both a neurological and septicaemic nature in seawater-farmed rainbow trout Oncorhynchus mykiss in Storfjorden, Norway. In November 2007, an outbreak of VHS associated with slightly elevated mortality was confirmed at a seawater site rearing rainbow trout (90 to 440 g). With...

Let Γn be the complete undirected Cayley graph of the odd cyclic group Zn. Connected graphs whose vertices are rainbow tetrahedra in Γn are studied, with any two such vertices adjacent if and only if they share (as tetrahedra) precisely two distinct triangles. This yields graphs G of largest degree 6, asymptotic diameter |V (G)| and almost all vertices with degree: (a) 6 in G; (b) 4 in exactly ...

Background: Much has been written about introduced rainbow trout (Oncorhynchus mykiss) interbreeding and outcompeting cutthroat trout (Oncorhynchus clarkii). However, the specific mechanisms by which rainbow trout and their hybrids outcompete cutthroat trout have not been thoroughly explored, and the published data is limited to lotic ecosystems. Materials and Methods: Samples of rainbow trout ...

A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. For a graph H and a positive integer n, the anti-Ramsey number f(n, H) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of H . The rainbow number rb(n, H) is the minimum number of colors such that any edge-coloring of Kn with rb(n, H) number of colors contains a rainbow copy o...