_________________________________________________________________________________________________ *Correspondence: Dr. Andrew J. Rainbow, Department of Biology, McMaster University, Hamilton, Ontario L8S 4K1, Tel: (905) 5259140 Ext. 23544 Fax: (905)-522-6066; E-mail: [email protected]

The susceptibility of 2 strains of rainbow trout Oncorhynchus mykiss, 1 from North America (TL) and 1 from Germany (GR), to Myxobolus cerebralis (the cause of salmonid whirling disease) was assessed following exposure to the infectious stages (triactinomyxons). Two laboratory experiments were conducted with age-matched rainbow trout of each strain. At the beginning of the study, the 2 trout str...

Given two graphs G and H, let f(G,H) denote the maximum number c for which there is a way to color the edges of G with c colors such that every subgraph H of G has at least two edges of the same color. Equivalently, any edge-coloring of G with at least rb(G,H) = f(G,H) + 1 colors contains a rainbow copy of H, where a rainbow subgraph of an edge-colored graph is such that no two edges of it have...

A tree T , in an edge-colored graph G, is called a rainbow tree if no two edges of T are assigned the same color. A k-rainbow coloring of G is an edge coloring of G having the property that for every set S of k vertices of G, there exists a rainbow tree T in G such that S ⊆ V (T ). The minimum number of colors needed in a k-rainbow coloring of G is the k-rainbow index of G , denoted by rxk(G). ...

We evaluated habitat features (i.e., substrate particle size, water depth, water velocity) at spawning redds and randomly selected reference locations (where spawning activity was not apparent) to determine importance of these features to rainbow trout (Oncorhynchus mykiss) spawning habitat use in the Pere Marquette River, Michigan, 1997 to 1999. Rainbow trout selected areas with small gravel, ...

In this paper, we prove that every 3-coloring of the positive integers such that the upper density of each color is greater than 4 contains a rainbow solution to a−b = c 2. A solution is rainbow if all of its elements are of different colors. Furthermore, the 4 bound is sharp. We also prove two results for rainbow solutions of a− b = c2 in Zn. One stipulates that if Zn, for an odd n, is partiti...

Let G be a properly edge colored graph. A rainbow matching of G is a matching in which no two edges have the same color. Let δ denote the minimum degree of G. We show that if |V (G)| ≥ 8δ 5 , then G has a rainbow matching of size at least ⌊ 5 ⌋. We also prove that if G is a properly colored triangle-free graph, then G has a rainbow matching of size at least ⌊ 3 ⌋.

Rainbow vertex-connection number is the minimum k-coloring on vertex graph G and denoted by rvc(G). Besides, rainbow-vertex connection can be applied to some special graphs, such as prism path graph. Graph operation a method used create new combining two graphs. Therefore, this research uses corona product form at resulting from of (Pm,2 P3) (P3 Pm,2). The results study obtain that theorem rain...

Much has been written about introduced rainbow trout interbreeding and outcompeting native cutthroat trout. However, the specific mechanisms by which rainbow trout and their hybrids outcompete cutthroat trout have not been thoroughly explored, and most of the published data is limited to lotic ecosystems. Samples of Snake River cutthroat trout (Oncorhynchus clarkii bouvieri), the rainbow-cutthr...

An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. In this paper we prove that rc(G) = 2 for every connected graph G of order n and size m, where (