OBSERVATIONS ON THE STRUCTURE, DYNAMICS AND ABBREVIATION OF ENTOMOFAUNE COLLECTED FROM CERTAIN AGRICULTURAL CROPS

The remarks were made in 2016 in the fruit tree, pear, peach, vine plantations, corn crops and cabbage crops, in two stations, stationary Vasile Adamachi, Iasi Iasi county and Ezereni farm in the Miroslava, Iasi County. The purpose of the paper was to compare the entomofauna by a number of different agricultural and field cultures, different as well as agroecosystem technology and conditions.The material was collected using the entomological filet, from June until September inclusive.The collected material was cleaned of vegetal remains and was then prepared for identification at species level. The analysis of the collected material shows that the samples collected belong to the Hexapoda Class, with several insect orders and the Arachnida Class, the Aranea order and the Acari order. Most of them belong to the Insecta class. The orders to which the species are collected are: Coleoptera, Heteroptera, Hymenoptera, Diptera, all of the Hexapoda class. As regards the abundance entomofauna, cultures, it is found that the wheat had been collected the multiple copies (69) followed by the growing of maize (39) and then planting vine (29) and plantations apple (24)

Computation of the vertex covering number of a graph, each block of which is a complete graph or a complete bipartite graph or a wheel or a power of a cycle or a power of a path

We consider the well-known problem of finding the vertex covering number of a graph. It is known that this problem is NP-hard. In this paper, we give an efficient algorithm for finding the vertex covering number for connected graphs whose blocks are either complete graphs or complete bipartite graphs or wheels or powers of cycles or powers of paths

Computation of the vertex covering number of a graph, each block of which is a complete graph or a complete bipartite graph or a wheel or a power of a cycle or a power of a path

We consider the well-known problem of finding the vertex covering number of a graph. It is known that this problem is NP-hard. In this paper, we give an efficient algorithm for finding the vertex covering number for connected graphs whose blocks are either complete graphs or complete bipartite graphs or wheels or powers of cycles or powers of paths

ABBREVIATIONS: for Pharmacology and Experimental Differential Effects of Muscarinic Receptor Agonists and Phorbol Ester on Muscarinic and D2-Dopamine Release-Modulatory Receptors

MAChA, = muscarinic cholinergic receptor(s); PDBu, = 4-beta-phorbol-12,13-dibutyrate; PFC, = prefrontal cortex; DA,