𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex dimension of complete graphs on even vertices

✍ Scribed by Hirofumi Nagasaka

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
551 KB
Volume
8
Category
Article
ISSN
0926-2245

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we study the flat maps from a finile graph G to a Euclidean space I? that were recentlq defined and studied in [4]. We define the vertex dimension of a finite graph and give some necessary conditions for a polygonal map to be flat. As a result we show that the vertex dimension of the complete graph on 21 vertices equals I.

πŸ“œ SIMILAR VOLUMES

One-factorizations of complete graphs wi
One-factorizations of complete graphs with vertex-regular automorphism groups
✍ Arrigo Bonisoli; Domenico Labbate πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 161 KB

## Abstract We consider one‐factorizations of __K__~2__n__~ possessing an automorphism group acting regularly (sharply transitively) on vertices. We present some upper bounds on the number of one‐factors which are fixed by the group; further information is obtained when equality holds in these boun

On the euclidean dimension of a complete
On the euclidean dimension of a complete multipartite graph
✍ 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