Among the techniques for capturing nearby groundwater, covered horizontal well (draining gallery) stands out in its different types of water mine, qanat, and cimbre. The collected by these means is used to supply people livestock, irrigation, movement hydraulic devices, etc. Because they are carried surface gravity (without need energy) because only recharging groundwater table that takes place...

Rats and mice were studied for changes in meal-taking structure in a closed operant food economy, in which the consummatory or unit prices for food were increased. In experiment 1, as food price increased, male rats modestly decreased the number of meals per day and increased mean meal size. Female rats were similar to males but had smaller meal size and, at low costs, took more meals per day. ...

Evaluation of ecosystem services has become a hotspot in terms of research focus, but uncertainties over appropriate methods remain. Evaluation can be based on the unit price of services (services value method) or the unit price of the area (area value method). The former takes meteorological factors into account, while the latter does not. This study uses Kunyu Mountain Nature Reserve as a stu...

A graph is Zm-well-covered if all maximal independent sets have the same cardinality modulo m. Zm-well-covered graphs generalise well-covered graphs, those in which all independent sets have the same cardinality. Z2-well-covered graphs are also called parity graphs. A characterisation of cubic well-covered graphs was given by Campbell, Ellingham and Royle. Here we extend this to a characterisat...

A graph is called well-covered if every maximal independent set of vertices of G is a maximum independent set; recall that S is independent if no two of its vertices are adjacent. In this paper we define the concept of well-covered by monochromatic paths graphs which is a variation of well-covered graphs. We consider some classical constructions of graphs: G-join of graphs and duplication of a ...

A graph G is well-covered if all its maximal stable sets have the same size, denoted by α(G) (M. D. Plummer, 1970). If sk denotes the number of stable sets of cardinality k in graph G, and α(G) is the size of a maximum stable set, then I(G;x) = α(G) ∑ k=0 skx k is the independence polynomial of G (I. Gutman and F. Harary, 1983). J. I. Brown, K. Dilcher and R. J. Nowakowski (2000) conjectured th...

A graph G is well-covered provided each maximal independent set of vertices has the same cardinality. The term sk of the independence sequence (s0, s1, . . . , sα) equals the number of independent k-sets of vertices of G. We investigate constraints on the linear orderings of the terms of the independence sequence of well-covered graphs. In particular, we provide a counterexample to the recent u...