A graph G is called a D-graph if for every set of cliques of G whose pairwise intersections are nonempty there is a vertex of G common to all the cliques of the set. A D-graph G is called a Dl-graph if it has the T 1 property: for any two distinct vertices x and y of G, there exist cliques C and D o
Characterization of a 2 g LiF bolometer
β Scribed by P. de Marcillac; N. Coron; J. Leblanc; C. Bobin; I. Berkes; M. De Jesus; J.P. Hadjout; L. Gonzalez-Mestres; J.W. Zhou
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 457 KB
- Volume
- 337
- Category
- Article
- ISSN
- 0168-9002
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Number of mtermed=atΒ’ coohng stattons, N Ftg.3 Minimum self-sufficient hod-off rate for various numbers of intermediate heat exchangers; rn/v--~ oo gwen by (13)
The 193 nm photolysis of acetylene has been used as a source of &(B 'Z: ) radicals, which are subsequently detected by laserinduced fluorescence technique. The pressure-dependent collisional lifetimes of this radical are experimentally determined by delaying the probe laser with respect to the photo