Accession Number : AD0721267

Title :   The Circular Dimension of a Graph,

Corporate Author : RAND CORP SANTA MONICA CALIF

Personal Author(s) : Feinberg,Robert B.

Report Date : OCT 1970

Pagination or Media Count : 21

Abstract : The circular dimension of a graph G is defined as the smallest integer m such that G has an m-arc intersection model. A graph is complete partite if its vertices can be partitioned into disjoint classes so that any two vertices from the same class are nonadjacent, while any two vertices from different classes are adjacent. In this paper the author indicates that the maximum circular dimension of any complete partite graph having n vertices is the largest integer p such that (2 sup p) + p = or < n + 1. (Author)

Descriptors :   (*GRAPHICS, *COMBINATORIAL ANALYSIS), THEOREMS

Subject Categories : Numerical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE