It has been suggested that white colour is beneficial for snails living in arid environments. In this work, shell coloration in the arid-dwelling land snail Sphincterochila (Albea) candidissima was manipulated during aestivation. Snails painted black lost more body weight than did control ones, presumably as a consequence of higher heat absorption. This suggests that light colour is advantageou...

a {em roman dominating function} on a graph $g$ is a function$f:v(g)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}a {em restrained roman dominating}function} $f$ is a {color{blue} roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} the wei...

Nitrogen is a crucial nutrient affecting plant growth and development and its addition to the soil (as chemical or organic form) influences plant growth characteristics. One experiment was conducted as a factorial based on RCBD with two Chrysanthemum cultivars (‘Fred’ and ‘Angel’( and two N-fertilizer sources [Urea (750 and 1500 g/ha and Nitroxin 7.5 and 15 L/ha] used as fertigation method besi...

Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N and W be the node count, the largest edge weight and the total weight of G. Let k(x, y) be log x/ log(x/y). We present a new decomposition theorem for maximum weight bipartite matchings and use it to design an O( √ nW/k(n,W/N))-time algorithm for computing a maximum weight matching of G. T...

this study was carried out to examine the effect of post hatch fasting (phf) period with and without subcutaneous injection of 0.6 ml ca-gluconate (ca-g) on productive performance and breast muscle development in broiler chicks up to day 28 of age. weight gain (wg) and feed intake (fi) were significantly reduced and fcr was increased as phf lasted for 36 h. injection of ca-g did not improve wg ...

Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N and W be the node count, the largest edge weight and the total weight of G. Let k(x, y) be log x/ log(x/y). We present a new decomposition theorem for maximum weight bipartite matchings and use it to design an O( √ nW/k(n,W/N))-time algorithm for computing a maximum weight matching of G. T...

Let G be a vertex-weighted graph in which each vertex has weight 1. Given a vertex u with positive weight and a neighbor v whose weight is at least the weight on u, a fractional acquisition move transfers some amount of weight at u from u to v. The fractional acquisition number of G, written af (G), is the minimum number of vertices with positive weight after a sequence of fractional acquisitio...