Scheduling on parallel processors for weighted-node graphs.

Extra t.p. with thesis statement inserted.

A generalization of Ramsey theory for graphs /

Includes bibliographical references.

Graphs for estimating atmospheric dispersion /

"This research was performed under an agreement between the U.S. Weather Bureau and the U.S. Atomic Energy Commission."

A note on a gamma distribution computer program and computer produced graphs /

"NOAA--S/T 77-2535"

Digital line graphs from 1:2,000,000-scale maps /

"US GeoData"--Cover.

Handbook of mathematical functions with formulas, graphs, and mathematical tables,

Mode of access: Internet.

Graphs of oblique photo scale factors and nadir point distances. For unit altitude, focal lengths: 6,12,24,36, and 48 inches; tilts: 0⁰ to 90⁰.

"Prepared ... for the U.S. Navy Bureau of Aeronautics, under contract NOas 57-585-c."

Graphs of calculations of energy deposition and air fluorescence from radiation produced by a nuclear explosion in space /

"Part of this work done under ARPA Order 631, Program Code No. 5820."

Theory of graphs.

Mode of access: Internet.

Graphs of meteorological and hydrological data.

Mode of access: Internet.

Statistical methods used in the measurement of radioactivity with some useful graphs and nomographs /

Mode of access: Internet.

Signal flow graphs and applications /

Bibliography: p. 207-210.

Decompositions of complete tripartite graphs into triangles with an edge attached

Let K(r, s, t) denote the complete tripartite graph with partite sets of size r, s and t, where r less than or equal to s less than or equal to t. Let D be the graph consisting of a triangle with an edge attached. We show that K(r, s, t) may be decomposed into copies of D if and only if 4 divides rs + st + rt and t less than or equal to 3rs/(r + s).

Common multiples of complete graphs and a 4-cycle

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.

Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K-n, is a 3-factorization of & in which the components of each factor are cubes. We show that there exists a cube factorization of & if and only if n equivalent to 16 (mod 24), thus providing a new family of uniform 3 -factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. (C) 2004 Wiley Periodicals, Inc.