𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On embedding of graphs into euclidean spaces of small dimension

✍ Scribed by J Reiterman; V Rödl; E S̆in̆ajová


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
400 KB
Volume
56
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Small congestion embedding of graphs int
✍ Matsubayashi, Akira; Ueno, Shuichi 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB 👁 1 views

We consider the problem of embedding graphs into hypercubes with minimal congestion. Kim and Lai showed that for a given N-vertex graph G and a hypercube it is NP-complete to determine whether G is embeddable in the hypercube with unit congestion, but G can be embedded with unit congestion in a hype

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

On the embedding of graphs into graphs w
✍ Vu, Van H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

A graph is called of type k if it is connected, regular, and has k distinct eigenvalues. For example graphs of type 2 are the complete graphs, while those of type 3 are the strongly regular graphs. We prove that for any positive integer n, every graph can be embedded in n cospectral, non-isomorphic

A remark on the uniqueness of embeddings
✍ Klaus Metsch 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

Suppose that q 2 2 is a prime power. We show that a linear space with a( q + 1)' + ( q + 1) points, where a 1 0.763, can be embedded in at most one way in a desarguesian projective plane of order q. 0 1995 John Wiley & Sons, he. ## 1. Introduction A linear space consists of points and lines such t