971 resultados para Reading and Interpretation of Statistical Graphs
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Microfilm. Ann Arbor, Mich., University Microfilms [n.d.] (American culture series, Reel 369.29)
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Bibliography: p. 185-187.
Resumo:
Referred to the Committee on military affairs and ordered printed with illustrations May 19, 1937.
Resumo:
Mode of access: Internet.
Resumo:
BS2555.W35
Resumo:
Senior thesis written for Oceanography 445
Resumo:
A graph G is a common multiple of two graphs H-1 and H-2 if there exists a decomposition of G into edge-disjoint copies of H-1 and also a decomposition of G into edge-disjoint copies of H-2. In this paper, we consider the case where H-1 is the 4-cycle C-4 and H-2 is the complete graph with n vertices K-n. We determine, for all positive integers n, the set of integers q for which there exists a common multiple of C-4 and K-n having precisely q edges. (C) 2003 Elsevier B.V. All rights reserved.
Resumo:
For all odd integers n greater than or equal to 1, let G(n) denote the complete graph of order n, and for all even integers n greater than or equal to 2 let G,, denote the complete graph of order n with the edges of a 1-factor removed. It is shown that for all non-negative integers h and t and all positive integers n, G, can be decomposed into h Hamilton cycles and t triangles if and only if nh + 3t is the number of edges in G(n). (C) 2004 Wiley Periodicals, Inc.