Abstract This paper presents a quantitative account of vegetation–environmental factor relationships in arid rangelands. Vegetation cover was recorded using Braun-Blanquet combined abundance-cover scale in each quadrat. Within each quadrat, one profile was dug and soil samples being taken at 0-20cm and 20-100cm depths. Under study physical-chemical characteristics included texture, lime, orga...

one of the most important information in urban forestry is acquaintance of urban landscape’s area or proportion. nowadays, in several countries variable methods are used to achieve this aim. since there is not any complete method to study urban forest’s status in iran, it is impossible to exert authentic management for these resources. hence, in this research, sampling methods and ikonos satell...

A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this article a lower and an upper bound for ψk of the rooted product graphs are presented. Two characterizations are given when those bounds are attained. Moreover ψ2 and ψ3 are exactly de...

No part of this book may be reproduced, in any form or by any means, without permission in writing from the author. Cover picture: Three dimensional schematic representation of the steps that lead to controller design. The fish is cloned for scientific purposes only, without permission of the Dutch government.

We show that for each integer h ≥ 2, there exists a least positive integer ch so that if P is a poset having a planar cover graph and the height of P is h, then the dimension of P is at most ch. Trivially, c1 = 2. Also, Felsner, Li and Trotter showed that c2 exists and is 4, but their proof techniques do not seem to apply when h ≥ 3. We focus on establishing the existence of ch, although we sus...

We consider capacitated vertex cover with hard capacity constraints (VC-HC) on hypergraphs. In this problem we are given a hypergraph G = (V,E) with a maximum edge size f . Each edge is associated with a demand and each vertex is associated with a weight (cost), a capacity, and an available multiplicity. The objective is to find a minimum-weight vertex multiset such that the demands of the edge...

Let G = (X, Y; E) be a balanced bipartite graph of order 2n. The path-cover number pc(H) of a graph H is the minimum number of vertex-disjoint paths that use up all the vertices of H. S ⊆ V(G) is called a balanced set of G if |S ∩ X| = |S ∩ Y|. In this paper, we will give some sufficient conditions for a balanced bipartite graph G satisfying that for every balanced set S, there is a bi-cycle of...

This article studies crime rates’ response to economic conditions. Using a longitudinal data set covering about 20 countries over the period 1970-2010, we investigate whether crime rates respond asymmetrically to increases in unemployment and recoveries in economic conditions. We find a positive response of crime rates on variation in unemployment rates, but we do not find compelling evidence o...

In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoods bijectively) if and only if G embeds in the projective plane. Though the ”if” direction is easy, and over ten related research papers have been published during the past 20 years of investigation, this beautiful con...