In apple cultivation, simulation models may be used to monitor fruit size during the growth and development process to predict production levels and to optimize fruit quality. Here, Fuji apples cultivated in spindle-type systems were used as the model crop. Apple size was measured during the growing period at an interval of about 20 days after full bloom, with three weather stations being used ...

in order to evaluate genetic diversity among squash landraces from northwest iran by morphological and physiological traits, 18 squash landraces belong to pumpkin, ornamental and confectionary groups were planted in completely randomized block design with three replications in agricultural research center of urmia in 2013. morphological characteristics related of fruit, seed, leave and flower a...

Endocarp lignifi cation is important fruit growth phenophase since aft er its completion fruit starts with oil accumulation. Th e information about duration of endocarp lignifi cation is important for timing of management practices, irrigation and pest control in oil cultivars, and fruit thinning in table cultivars to obtain uniform fruit weight and size. In this study, fruit length, width and ...

Municipal solid waste compost (MSWC) and/or fertigation used in greenhouse pepper (Capsicum annuum L.) cultivation with five different substrates with soil (S) and/or MSWC mixtures (0-5-10-20-40%) used with or without fertigation. Plants growth increased in 10-20% MSWC and fertigation enhanced mainly the plant height. Fruit number increased in S : MSWC 80 : 20 without fertilizer. Plant biomass ...

this study was performed in order to evaluate the effects of application of super absorbent on the yield and water use efficiency of cucumber under deficit irrigation conditions in greenhouse. plants cultivated in plastic pots and irrigation emitter with four liters per hour discharge was performed. three levels of irrigation water height (10, 8.3 and 6.2 mm day-1) were used as the main factor ...

A pure simplicial complex of dimension d − 1 (or a (d − 1)-complex, for short) is any family C of d-element subsets of a set V (tipycally, V = [n] := {1, . . . , n}). Elements of C are called facets of C and any subset of a facet is called a face. More precisely, a k-face is a face with k + 1 elements. Faces of dimensions 0, 1, and d − 2 are called, respectively, vertices, edges and ridges of C...

It is known that Moore digraphs of degree d > 1 and diameter k > 1 do not exist (see [16] or [4]). For degree 2, it has been shown that for diameter k ~ 3 there are no digraphs of order 'close' to, i.e., one less than, the Moore bound (14). For diameter 2, it is known that digraphs close to Moore bound exist for any degree because the line digraphs of complete digraphs are an example of such di...

The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree ∆ and the diameter D, was introduced in [1], as a generalization of the Degree-Diameter Problem. A case of special interest is when the host graph is a common parallel architecture. Here we discuss the case when the host graph is a k-dimensional mesh. We provide s...

A graph of diameter k is critical if the deletion of any vertex results in a of diameter at least k + 1. It was conjectured by Boals et. al. that the maximum of a critical graph of diameter 2 on n vertices is at most the that for n 2 7 the maximum in such a graph is n 4 when n is odd and n 5 when n is even. We construct for each n 2: 7 a critical graph of maximum degree Our graphs provide a goo...