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

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

Ali Bahadori, Banafsheh Zeraatkar Mohammad Taghi Taghizadeh, Parinaz Seifi-Aghjekohal

The thermal degradation of polyethylene (PE) was carried out in the absence and presence ofcatalystes X-Zeolite and Silica-Alumina at different temperatures. The optimum PE/Catalysisratio was 0.25:0.05 g/g, which produced highest degradation value. PE and PE/Catalysis werecharacterized by thermogravimetric analysis. The thermal degradation properties of polymerhave been studied by Infrared spec...

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.

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

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