نتایج جستجو برای: flat cover

تعداد نتایج: 167328  

A. Monsefi, A.R. Sharma N. Rang Zan

The effect of tillage, crop establishment and weed management was studied on theperformance of wheat grown after soybean at New Delhi, India during 2010-11 to 2011-12.Sixteen treatment combinations involved 2 tillage, viz. conventional tillage (CT) and zero tillage(ZT), two crop establishment practices, viz. raised-bed and flat-bed and four weed management,viz. isoproturon + hand weeding, mesos...

غفاری نژاد, سید علی, مؤمنی, داود,

To investigate the effects of different methods of seed bed preparation on yield of greenhouse cucumber, a two-year long experiment was conducted as a randomized complete block design with four replications in Jiroft from 2004. Different methods of seed bed preparation were as follows: 1) ridge with 20 cm height and 50 cm width and 2 plant rows with 40 cm distance, 2) furrow with 20 cm depth an...

Journal: :Combinatorica 1986
Noga Alon

An equivalence graph is a vertex disjoint union of complete graphs. For a graph G, let eq(G) be the irdnimum number of equivalence subgraphs of G needed to cover all edges of G. Similarly, let cc(G) be the minimum number of complete subgraphs of G needed to cover all its edges. Let H be a graph on n vertices with ma,'dmal degree _~d (and minimal degree --~ 1), and let G=I~ be its complement. We...

2008
E. Bueler

Introduction Conclusions References Tables Figures ◭ ◮ ◭ ◮ Back Close Full Screen / Esc Abstract Introduction Conclusions References

2014
Irfan Sljivo Barbara Gallina Jan Carlson Hans A. Hansson

Composable safety certification envisions reuse of safety case argument-fragments together with safety-relevant components in order to reduce the cost and time needed to achieve certification. The argumentfragments could cover safety aspects relevant for different contexts in which the component can be used. Creating argument-fragments for the out-of-context components is time-consuming and cur...

Journal: :Networks 1994
Wayne Goddard

In this paper a schema of graphical parameters is proposed. Based on the parameter integrity introduced by Barefoot, Entringer and Swart, members Ψ(G) of this schema have the general form Ψ(G) = min{ |S| + ψ(G − S) : S ⊂ V (G) }, where ψ(G) is another given graphical parameter. Examples include integrity, mean integrity, connectivity and vertex cover number. General results and bounds for the s...

2006
ANDREW E. M. LEWIS

We show that there exists a Martin-Löf random degree which has a strong minimal cover.

2012
RODRIGO TREVIÑO

We prove the non-uniform hyperbolicity of the Kontsevich-Zorich cocycle for a measure supported on abelian differentials which come from nonorientable quadratic differentials through a standard orienting, double cover construction. The proof uses Forni’s criterion [For11] for non-uniform hyperbolicity of the cocycle for SL(2,R)-invariant measures. We apply these results to the study of deviatio...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید