Stock evaluation and development of a breeding program for common carp (Cyprinus carpio) in Karnataka, India: progress of a research project

Common carp (Cyprinus carpio) is the single most important species for aquaculture in the state of Karnataka, India, where it is generally grown in polyculture with Indian major carps. Precocious maturation and unwanted reproduction in the species have been identified as constraints to increase production in aquaculture and culture-based fisheries in Karnataka state. Stocks of C. carpio obtained from Hungary (Amur and P3), Indonesia (Rajdanu) and Vietnam (SV) are being assessed alongside two local stocks (L-BRP and L-FRS) in a series of culture performance trials with the objective of setting up a base population for selective breeding. The paper presents progress of research being undertaken at the Fisheries Research Station, University of Agricultural Sciences, Bangalore, India

Rainbow Connection Number and Radius

The rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of its vertices is connected by at least one path in which no two edges are coloured the same. In this note we show that for every bridgeless graph G with radius r, rc(G) <= r(r + 2). We demonstrate that this bound is the best possible for rc(G) as a function of r, not just for bridgeless graphs, but also for graphs of any stronger connectivity. It may be noted that for a general 1-connected graph G, rc(G) can be arbitrarily larger than its radius (Star graph for instance). We further show that for every bridgeless graph G with radius r and chordality (size of a largest induced cycle) k, rc(G) <= rk. It is known that computing rc(G) is NP-Hard [Chakraborty et al., 2009]. Here, we present a (r+3)-factor approximation algorithm which runs in O(nm) time and a (d+3)-factor approximation algorithm which runs in O(dm) time to rainbow colour any connected graph G on n vertices, with m edges, diameter d and radius r.Comment: Revised preprint with an extra section on an approximation algorithm. arXiv admin note: text overlap with arXiv:1101.574