On the euclidean dimension of a complete
β
Hiroshi Maehara
π
Article
π
1988
π
Elsevier Science
π
English
β 272 KB
The euclidean dimension of a graph G, e(G), is the minimum n such that the vertices of G can be placed in euclidean n-space, R", in such a way that adjacent vertices have distance 1 and nonadjacent vertices have distances other than 1. Let G = K(n,, . , ns+,+J be a complete (s + t + u)-partite graph