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
โฆ LIBER โฆ
The influence of graph structure on generalized dimension exchange
โ Scribed by B. Litow
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 640 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On the euclidean dimension of a complete
โ
Hiroshi Maehara
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 272 KB
On the efficiency of regular generalized
โ
Ching-Shui Cheng; Gregory M. Constantine
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 712 KB
Influence of the heterogeneous structure
โ
Hong-Joo Lee; Min-Kyoung Hong; Sang-Don Han; Seung-Hyeon Moon
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 514 KB
On the anomalous dimensions of the multi
โ
Bo-Wen Xiao
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 352 KB
On the structure of generalized quadrang
โ
Clark T Benson
๐
Article
๐
1970
๐
Elsevier Science
๐
English
โ 601 KB
On the variance of the random sphere of
โ
P. Hitczenko; S. Janson; J. E. Yukich
๐
Article
๐
1999
๐
John Wiley and Sons
๐
English
โ 219 KB
๐ 2 views
We show that the variance of the number of edges in the random sphere of influence graph built on n i.i.d. sites which are uniformly distributed over the unit cube in R d , grows linearly with n. This is then used to establish a central limit theorem for the number of edges in the random sphere of i